Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions:48771 | Accepted: 15417 |
Description
Happily, Sally has a friend who loans her a very accurate balance scale. The friend will permit Sally three weighings to find the counterfeit coin. For instance, if Sally weighs two coins against each other and the scales balance then she knows these two coins are true. Now if Sally weighs
one of the true coins against a third coin and the scales do not balance then Sally knows the third coin is counterfeit and she can tell whether it is light or heavy depending on whether the balance on which it is placed goes up or down, respectively.
By choosing her weighings carefully, Sally is able to ensure that she will find the counterfeit coin with exactly three weighings.
Input
Output
Sample Input
1 ABCD EFGH even ABCI EFJK up ABIJ EFGH even
Sample Output
K is the counterfeit coin and it is light.
Source
枚举A到L都是轻的假币和都是重的假币的所有情况。
假设c是轻的假币,那么:
当结果是up的时候c必然出现在天平右边;
当结果是down的时候c必然出现在天平左边;
当结果是even的时候c必然不出现在天平左边或者右边。
假设c是重的假币也是同理。
以下是ac代码:
//poj 1013 假币
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char Left[3][7],Right[3][7],res[3][5];
bool judge(char c,bool light){
for(int i=0;i<3;i++){
char *pleft,*pright;
if(light){
pleft=Left[i];
pright=Right[i];
}else{
pleft=Right[i];
pright=Left[i];
}
switch(res[i][0]){
case 'u':
if(strchr(pright,c)==NULL)return false;
break;
case 'e':
if(strchr(pright,c)||strchr(pleft,c))return false;
break;
case 'd':
if(strchr(pleft,c)==NULL)return false;
break;
}
}
return true;
}
int main(){
int t;
cin>>t;
while(t--){
for(int i=0;i<3;i++){
cin>>Left[i]>>Right[i]>>res[i];
}
for(char c='A';c<='L';c++){
if(judge(c,true)){
printf("%c is the counterfeit coin and it is light.\n",c);
break;
}
if(judge(c,false)){
printf("%c is the counterfeit coin and it is heavy.\n",c);
break;
}
}
}
return 0;
}