Foj 1003 Counterfeit Dollar【简单智力题】

http://acm.fzu.edu.cn/problem.php?pid=1003

题目大意：一打（12个）硬币里有一个质量和其他11个不太一样，现在已知称量3次的情况，求质量有问题的硬币的编号和它是重了还是轻了。

直接枚举24种情况（第i块硬币重了还是轻了）再判断。

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
using namespace std;
template <class T> void checkmin(T &t,T x) {if(x < t) t = x;}
template <class T> void checkmax(T &t,T x) {if(x > t) t = x;}
template <class T> void _checkmin(T &t,T x) {if(t==-1) t = x; if(x < t) t = x;}
template <class T> void _checkmax(T &t,T x) {if(t==-1) t = x; if(x > t) t = x;}
typedef pair <int,int> PII;
typedef pair <double,double> PDD;
typedef long long ll;
#define foreach(it,v) for(__typeof((v).begin()) it = (v).begin(); it != (v).end ; it ++)
int n , id , an;
string s1[3] , s2[3] , s3[3];
int a[12];
bool check(string s1 , string s2 , string s3) {
    int a1 = 0 , a2 = 0;
    int len = s1.length();
    for(int i=0;i<len;i++) a1 += a[s1[i]-'A'] , a2 += a[s2[i]-'A'];
    if(s3 == "even") return a1 == a2;
    if(s3 == "up") return a1 > a2;
    if(s3 == "down") return a1 < a2;
}
void solve() {
    for(int i=0;i<2;i++) {
        for(int j=0;j<12;j++) {
            a[j] = i;
            for(int k=0;k<12;k++) {
                if(k == j) continue;
                a[k] = !a[j];
            }
            if(check(s1[0],s2[0],s3[0]) && check(s1[1],s2[1],s3[1]) && check(s1[2],s2[2],s3[2])) {
                id = j; an = i;
                return;
            }
        }
    }
}
int main() {
    scanf("%d",&n);
    while(n--) {
        for(int i=0;i<3;i++) cin >>s1[i]>>s2[i]>>s3[i];
        solve();
        printf("%c is the counterfeit coin and it is %s.\n",id+'A',(an?"heavy":"light"));
    }
    return 0;
}

 

 

 

转载于:https://www.cnblogs.com/aiiYuu/archive/2013/04/07/3003781.html