poj 1013 称硬币
2018-02-25 19:51
441 查看
Counterfeit Dollar
DescriptionSally 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.InputThe 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.OutputFor 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 Input1
ABCD EFGH even
ABCI EFJK up
ABIJ EFGH even Sample OutputK is the counterfeit coin and it is light. SourceEast Central North America 1998枚举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;
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions:48771 | Accepted: 15417 |
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.InputThe 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.OutputFor 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 Input1
ABCD EFGH even
ABCI EFJK up
ABIJ EFGH even Sample OutputK is the counterfeit coin and it is light. SourceEast Central North America 1998枚举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;
}
相关文章推荐
- POJ1029 & POJ1013 - 找哪个是假硬币...思维
- POJ 1029 硬币称量类型二 与POJ 1013类比 模拟题
- 模拟,找次品硬币,Counterfeit Dollar(POJ 1013)
- POJ1013称硬币
- POJ 1029 硬币称量类型二 与POJ 1013类比 模拟题
- POJ 1013 称硬币 枚举 花式调bug 易犯错误
- POJ1013称硬币
- poj 1013 称硬币
- poj 1013 && poj 1029【寻找硬币】
- POJ1013 称硬币
- 第一周 枚举 例题4.称硬币 [POJ1013]
- poj1013 -Counterfeit Dollar 称硬币问题-详解
- POJ 1013 Counterfeit Dollar 找假硬币 模拟
- 硬币称重问题之POJ1013-Counterfeit Dollar
- POJ 1013 模拟题硬币称量
- POJ 1029 硬币称量类型二 与POJ 1013类比 模拟题
- POJ 1013 称硬币
- poj 1742 硬币面值 拼凑 重解 poj 1014
- Poj1013 水题
- POJ 1013 Counterfeit Dollar