p1013.cpp

大概POJ上50道比较难的题的代码

#include <iostream>
using namespace std;
int main(){
    string l[3],r[3],e[3];
    int N;
    cin >> N;
    while(N--){
        bool flag(0);
        char ans1;
        int ans2,k,low(9999),upp(0);
        for(int i = 0;i < 3;++i){
            cin >> l[i] >> r[i] >> e[i];
            for(int j = 0;j < l[i].size();++j){
                low = min(low,l[i][j] - 'A');
                upp = max(upp,l[i][j] - 'A');
                low = min(low,r[i][j] - 'A');
                upp = max(upp,r[i][j] - 'A');
            }
        }
        for(int i = low;i <= upp && !flag;++i)
            for(int j = 0;j < 2 && !flag;++j){
                char c(i + 'A');
                for(k = 0;k < 3;++k){
                    if(l[k].find(c) == string::npos && r[k].find(c) == string::npos && e[k] != "even") break;
                    if(l[k].find(c) != string::npos && r[k].find(c) != string::npos)
                        if(e[k] != "even") break;else;
                    else{
                        if(j == 0){
                            if(l[k].find(c) != string::npos && e[k] != "down") break;
                            if(r[k].find(c) != string::npos && e[k] != "up") break;
                        }
                        if(j == 1){
                            if(r[k].find(c) != string::npos && e[k] != "down") break;
                            if(l[k].find(c) != string::npos && e[k] != "up") break;
                        }
                        if((l[k].find(c) != string::npos || r[k].find(c) != string::npos) && e[k] == "even") break;
                    }
                }
                if(k == 3){
                    flag = 1;
                    ans1 = c;
                    ans2 = j;
                }
            }
        if(ans2) printf("%c is the counterfeit coin and it is heavy.\n",ans1);
        else printf("%c is the counterfeit coin and it is light.\n",ans1);
    }
}