POJ1013秤硬币

举报
ReCclay 发表于 2022/02/22 02:14:59 2022/02/22
【摘要】 POJ1013 Description   Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit ...

POJ1013

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 weighsone 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. 

Ps:PS:今天写这个题真是恶心至死。一个main不小心写成了mian 一直提示||error: ld returned 1 exit status|。可就是检查不出错误!太粗心!



  
  1. #include <iostream>
  2. #include <cstring>
  3. using namespace std;
  4. char Left[3][7];
  5. char Right[3][7];
  6. char result[3][7];
  7. bool IsFake(char c, bool light);
  8. int main()
  9. {
  10. int t;
  11. cin >> t;
  12. while(t--)
  13. {
  14. for(int i=0; i<3; i++)
  15. {
  16. cin >> Left[i] >> Right[i] >> result[i];
  17. }
  18. for(char c='A'; c<='L'; c++)
  19. {
  20. if(IsFake(c, true))
  21. {
  22. cout << c <<" is the counterfeit coin and it is light.\n";
  23. break;
  24. }
  25. else if(IsFake(c, false))
  26. {
  27. cout << c <<" is the counterfeit coin and it is heavy.\n";
  28. break;
  29. }
  30. }
  31. }
  32. return 0;
  33. }
  34. bool IsFake(char c, bool light)
  35. {
  36. for(int i=0; i<3; i++)
  37. {
  38. char *pLeft;
  39. char *pRight;
  40. if(light)
  41. {
  42. pLeft = Left[i];
  43. pRight = Right[i];
  44. }
  45. else
  46. {
  47. pLeft = Right[i];
  48. pRight = Left[i];
  49. }
  50. switch(result[i][0])
  51. {
  52. case 'u':
  53. if( strchr(pRight, c) == NULL)
  54. return false;
  55. break;
  56. case 'e':
  57. if( strchr(pRight, c) || strchr(pLeft, c))
  58. return false;
  59. break;
  60. case 'd':
  61. if( strchr(pLeft, c) == NULL)
  62. return false;
  63. break;
  64. }
  65. }
  66. return true;
  67. }


文章来源: recclay.blog.csdn.net,作者:ReCclay,版权归原作者所有,如需转载,请联系作者。

原文链接:recclay.blog.csdn.net/article/details/59767497

【版权声明】本文为华为云社区用户转载文章,如果您发现本社区中有涉嫌抄袭的内容,欢迎发送邮件进行举报,并提供相关证据,一经查实,本社区将立刻删除涉嫌侵权内容,举报邮箱: cloudbbs@huaweicloud.com
  • 点赞
  • 收藏
  • 关注作者

评论(0

0/1000
抱歉,系统识别当前为高风险访问,暂不支持该操作

全部回复

上滑加载中

设置昵称

在此一键设置昵称,即可参与社区互动!

*长度不超过10个汉字或20个英文字符,设置后3个月内不可修改。

*长度不超过10个汉字或20个英文字符,设置后3个月内不可修改。