STL training (uva上一些比较好的用来熟悉STL)

题目都比较简单这里只给题号和代码:

uva 141, uva 11988, uva 10700, uva 10954, uva 10887, uva 10391, uva 10282, uva 673

#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <algorithm>

using namespace std;

set<string> ocr;
int n;

string MS(int lc[][51])
{
    string ret = "";
    for(int i=0; i<n; i++)
    for(int j=0; j<n; j++){
        ret = ret+char(lc[i][j]+'0');
    }
    return ret;
}

void spin(int lc[][51]){
    int temp[51][51] ={0};
    for(int i=0; i<4; i++){
        for(int j=0; j<n; j++){
            for(int k=0; k<n; k++){
                temp[k][n-1-j] = lc[j][k];
            }
        }
        memcpy(lc, temp, sizeof temp);
        ocr.insert(MS(temp));
    }

}

int main()
{
//    freopen("in.txt", "r", stdin);

    int a, b, lc[51][51], isans;
    char op;
    while(scanf("%d", &n)!=EOF && n)
    {
        memset(lc, 0, sizeof lc);
        ocr.clear();isans = 0;
        ocr.insert(MS(lc));
        for(int i=0; i<2*n; i++){
            scanf("%d%d", &a, &b);cin >> op;
            if(isans)continue;
            a--;b--;
            if(op=='-')lc[a][b] = 0;
            else lc[a][b] = 1;

            if(ocr.count(MS(lc))!=0){
                if(i%2==0)printf("Player 2 wins on move %d
", i+1);
                else printf("Player 1 wins on move %d
", i+1);
                isans = 1;
            }else spin(lc);
        }
        if(!isans)printf("Draw
");
    }
    return 0;
}

#include <iostream>
#include <cstdio>
#include <string.h>
#include <list>
using namespace std;
char str[1000100];
int main()
{
    while(gets(str)){
        list<char> l;
        list<char>::iterator p = l.begin();
        int len = strlen(str);
        for(int i=0; i<len; i++){
            if(str[i]=='[')p = l.begin();
            else if(str[i]==']')p = l.end();
            else l.insert(p, str[i]);
        }
        for(p = l.begin(); p!=l.end(); ++p)cout << *p;
        cout << endl;
    }
    return 0;
}

#include <iostream>
#include <cstdio>
#include <stack>

using namespace std;

typedef long long ll;
stack<ll> ls, bs;

void work(int op)
{
    if(op==1){
        ll temp = bs.top();bs.pop();
        temp += bs.top();bs.pop();
        bs.push(temp);
    }
    if(op==2){
        ll temp = ls.top();ls.pop();
        temp *= ls.top();ls.pop();
        ls.push(temp);
    }
}

int main()
{
//    freopen("in.txt", "r", stdin);

    int T;char c;
    scanf("%d", &T);
    getchar();
    while(T--)
    {
        ll minans = 0, maxans = 1, num = 0, op=-1;
        while(c = getchar()){
            if(c=='
')break;
            if(c=='+' || c=='*'){
                ls.push(num);bs.push(num);
                num = 0;
                work(op);
                if(c=='+')op = 1;
                else op = 2;
                continue;
            }
            num*=10;
            num+=(c-'0');
        }
        ls.push(num);bs.push(num);
        work(op);
        while(!ls.empty()){minans += ls.top();ls.pop();}
        while(!bs.empty()){maxans *= bs.top();bs.pop();}
        printf("The maximum and minimum are %lld and %lld.
", maxans, minans);
    }
    return 0;
}

#include <iostream>
#include <cstdio>
#include <queue>
#include <vector>
using namespace std;

int main()
{
//    freopen("in.txt", "r", stdin);

    int n, num;
    while(scanf("%d", &n)!=EOF && n){
        priority_queue<int, vector<int>, greater<int> > q;
        for(int i=0; i<n; i++){
            cin >> num;
            q.push(num);
        }
        int ans = 0;
        while(!q.empty()){
            num = q.top(); q.pop();
            if(q.empty())break;
            num += q.top(); q.pop();
            ans+=num; q.push(num);
        }
        cout << ans << endl;
    }
    return 0;
}

#include <iostream>
#include <cstdio>
#include <set>

using namespace std;

const int LEN = 1510;

int main()
{
//    freopen("in.txt", "r", stdin);

    int T, n, m;
    char ss[LEN];
    set<string> dir;
    string str[LEN], buf;
    cin >> T;
    for(int kase = 1; T--; kase++){
        cin >> n >> m ;
        getchar();
        dir.clear();
        for(int i=0; i<n; i++){
            gets(ss);
            str[i] = ss;
        }
        for(int j=0; j<m; j++){
            gets(ss);
            buf = ss;
            for(int j=0; j<n; j++)dir.insert(str[j]+buf);
        }
        printf("Case %d: %d
", kase, dir.size());
    }
    return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>

using namespace std;

const int LEN = 120001;
set<string> dic;
char str[LEN][50];

bool Judge(int x, int p, int len){
    char a[50], b[50], pa = 0, pb = 0;
    for(int i=0; i<len; i++){
        if(i<p)a[pa++] = str[x][i];
        else b[pb++] = str[x][i];
    }
    a[pa] = b[pb] = 0;
    if(dic.find(a)!=dic.end() && dic.find(b)!=dic.end())return true;
    else return false;
}

int main()
{
//    freopen("in.txt", "r", stdin);
    int len = 0;
    while(scanf("%s", str[len])!=EOF){
        dic.insert(str[len]);
        len ++;
    }
    for(int i=0; i<len; i++){
        int l = strlen(str[i]);
        for(int j=1; j<l-1; j++){
            if(Judge(i, j, l)){
                cout << str[i] << endl;
                break;
            }
        }
    }
    return 0;
}

#include <cstdio>
#include <iostream>
#include <map>

using namespace std;

int main()
{
//    freopen("in.txt", "r", stdin);

    char a[21], b[21];
    map<string, string> dic;
    while(scanf("%s", a)!=EOF){
        if(getchar()=='
')break;
        scanf("%s", b);
        dic[b] = a;
    }
    cout << dic[a] << endl;
    while(scanf("%s", a)!=EOF)
    {
        if(dic.count(a))cout << dic[a] << endl;
        else cout << "eh" << endl;
    }
    return 0;
}

#include <iostream>
#include <cstdio>
#include <stack>
#include <string.h>
using namespace std;

int main()
{
//    freopen("in.txt", "r", stdin);

    int T;
    char str[10100];
    cin >> T;
    getchar();
    while(T--){
        stack<char> s;
        int ans = 1, len, i=0;
        gets(str);
        len = strlen(str);
        while(i<len){
            str[i] = str[i];
            if(str[i]=='[' || str[i]=='(')s.push(str[i]);
            else if(str[i]==']' && !s.empty() && s.top()=='[')s.pop();
            else if(str[i]==')' && !s.empty() && s.top()=='(')s.pop();
            else {ans = 0;break;}
            i++;
        }
        if(!s.empty())ans = 0;
        if(ans)cout << "Yes" << endl;
        else cout << "No" << endl;
    }
}