称假币（枚举）

点击打开链接

Counterfeit Dollar

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 47432 Accepted: 14994

Description

Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit even though its color and size make it indistinguishable from the real silver dollars. The counterfeit coin has a different weight from the other coins but Sally does not know if it is heavier or lighter than the real coins. 
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

The first line of input is an integer n (n > 0) specifying the number of cases to follow. Each case consists of three lines of input, one for each weighing. Sally has identified each of the coins with the letters A--L. Information on a weighing will be given by two strings of letters and then one of the words ``up'', ``down'', or ``even''. The first string of letters will represent the coins on the left balance; the second string, the coins on the right balance. (Sally will always place the same number of coins on the right balance as on the left balance.) The word in the third position will tell whether the right side of the balance goes up, down, or remains even.

Output

For each case, the output will identify the counterfeit coin by its letter and tell whether it is heavy or light. The solution will always be uniquely determined.

Sample Input

1 ABCD EFGH even ABCI EFJK up ABIJ EFGH even 

Sample Output

K is the counterfeit coin and it is light. 

Source

East Central North America 1998

 解题思路 
      
     对于每一枚硬币先假设它是轻的，看这样是否符合称量结果。如果符合，

问题即解决。如果不符合，就假设它是重的，看是否符合称量结果。把所有硬币都
试一遍，一定能找到特殊硬币 

代码实现

#include <iostream> #include <cstring> using namespace std; char Left[3][7];   //天平左边硬币  char Right[3][7];  //天平右边硬币  char result[3][7]; //结果  bool IsFake(char c,bool light) ; //light 为真表示假设假币为轻，否则表示假设假币为重  int main() {    int t;   cin >> t;   while(t--) {      for(int i = 0;i < 3; ++i) cin >> Left[i] >> Right[i] >> result[i];    for(char c='A'; c<='L';c++) {       if( IsFake(c,true) ){            cout << c << " is the counterfeit coin and it is light.\n";           break;       }       else if( IsFake(c,false) ){           cout << c << " is the counterfeit coin and it is heavy.\n";           break;       }     }   }   return 0; }            bool IsFake(char c,bool light)  //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(result[i][0]) {       case 'u':         if ( strchr(pRight,c) == NULL)           return false;         break;       case 'e':         if( strchr(pLeft,c) || strchr(pRight,c))           return false;         break;       case 'd':         if ( strchr(pLeft,c) == NULL)           return false;         break;     }   }   return true; }