Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 50492 | Accepted: 15800 |
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
#include<math.h> #include<stdio.h> #include<string.h> #include<algorithm> char yuansu[12]={'A','B','C','D','E','F','G','H','I','J','K','L'}; int t,k,n,flag,max; int time[12],jdg[12]; char a[3][10],b[3][10],c[3][10]; int search(char e){ for(int i=0;i<12;i++) if(yuansu[i]==e) return i; return -1; } int main(){ scanf("%d",&t); getchar(); while(t--){ for(int i=0;i<12;i++){ jdg[i]=0;time[i]=0; } for(int i=0;i<3;i++){ scanf("%s%s%s",a[i],b[i],c[i]); getchar(); flag=-1; if(strcmp(c[i],"even")==0){ n=strlen(a[i]); for(int j=0;j<n;j++){ k=search(a[i][j]); jdg[k]=1; } n=strlen(b[i]); for(int j=0;j<n;j++){ k=search(b[i][j]); jdg[k]=1; } } else if(strcmp(c[i],"up")==0){ n=strlen(a[i]); for(int j=0;j<n;j++){ k=search(a[i][j]); time[k]++; } n=strlen(b[i]); for(int j=0;j<n;j++){ k=search(b[i][j]); time[k]--; } } else if(strcmp(c[i],"down")==0){ n=strlen(a[i]); for(int j=0;j<n;j++){ k=search(a[i][j]); time[k]--; } n=strlen(b[i]); for(int j=0;j<n;j++){ k=search(b[i][j]); time[k]++; } } } max=-1; for(int i=0;i<12;i++){ if(jdg[i]) continue; if(max<=fabs(time[i])){ max=fabs(time[i]); flag=i; } } printf("%C is the counterfeit coin and it is ",yuansu[flag]); if(time[flag]<0) printf("light.\n"); else printf("heavy.\n"); } } /* 1 ABCD EFGH even ABCI EFJK up ABIJ EFGH even */