POJ 1013 Counterfeit Dollar
来源:互联网 发布:淘宝店铺怎么从新激活 编辑:程序博客网 时间:2024/06/04 00:24
Counterfeit Dollar
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 40006 Accepted: 12747
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.
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 <string>#include <map>using namespace std;int main(){int n;cin>>n;map<char,int> m;while(n--){string s1,s2,ans;for(char i='A';i<='L';i++)m[i]=-1;for(int i=0;i<3;i++){cin>>s1>>s2>>ans;if(ans[0]=='e'){for(int j=0;j<s1.length();j++){m[s1[j]]=m[s2[j]]=0;}}if(ans[0]=='u'){map<char,int> v;for(int j=0;j<s1.length();j++){v[s1[j]]=1;if(m[s1[j]]!=0&&m[s1[j]]!=1){m[s1[j]]=2;}else{m[s1[j]]=0;}}for(int j=0;j<s2.length();j++){v[s2[j]]=1;if(m[s2[j]]!=0&&m[s2[j]]!=2){m[s2[j]]=1;}else{m[s2[j]]=0;}}for(char k='A';k<='L';k++){if(!v[k]){m[k]=0;}}}if(ans[0]=='d'){map<char,int> v;for(int j=0;j<s1.length();j++){v[s1[j]]=1;if(m[s1[j]]!=0&&m[s1[j]]!=2){m[s1[j]]=1;}else{m[s1[j]]=0;}}for(int j=0;j<s2.length();j++){v[s2[j]]=1;if(m[s2[j]]!=0&&m[s2[j]]!=1){m[s2[j]]=2;}else{m[s2[j]]=0;}}for(char k='A';k<='L';k++){if(!v[k]){m[k]=0;}}}}for(char i='A';i<='L';i++){if(m[i]==1){cout<<i<<" is the counterfeit coin and it is light."<<endl;break;}if(m[i]==2){cout<<i<<" is the counterfeit coin and it is heavy."<<endl;break;}elsecontinue;}}return 0;}
0 0
- POJ 1013 Counterfeit Dollar
- POJ 1013 Counterfeit Dollar
- POJ 1013 Counterfeit Dollar
- POJ 1013 Counterfeit Dollar
- POJ 1013 Counterfeit Dollar
- POJ 1013 Counterfeit Dollar
- POJ 1013 Counterfeit Dollar
- POJ 1013 Counterfeit Dollar
- POJ 1013 counterfeit dollar
- POJ 1013 Counterfeit Dollar
- poj 1013 Counterfeit Dollar
- POJ 1013 Counterfeit Dollar
- poj 1013 Counterfeit Dollar
- poj-1013 Counterfeit Dollar
- POJ 1013 Counterfeit Dollar
- POJ-1013-Counterfeit Dollar
- poj 1013 Counterfeit Dollar
- [POJ][1013]Counterfeit Dollar
- android 开发者需要了解的
- hdu 4291 矩阵幂 循环节
- 笔试和面试中遇到的问题(1)
- windows下使用memcache并修改memcache最大使用内存
- Android中使用animation的方法
- POJ 1013 Counterfeit Dollar
- iOS学习笔记——视图上移与键盘弹回
- nyoj-270-数的分解
- FireMonkey 之 360safe界面
- poj 1985 Cow Marathon(树直径)
- 常用的app上传平台!
- android 动画使用机制2
- 字符串匹配之二:DNA序列匹配度的计算
- 第8周 项目6 本月几天?