ACM OJ上的题目1013:Counterfeit DollarSJ has a dozen Voyageur silver dollars.However,only eleven of the coins are true silver dollars; one coin is counterfeit .The counterfeit coin has a different weight from the other coins but Sally does not kno

来源:学生作业帮助网 编辑:作业帮 时间:2024/04/28 02:42:50

ACM OJ上的题目1013:Counterfeit DollarSJ has a dozen Voyageur silver dollars.However,only eleven of the coins are true silver dollars; one coin is counterfeit .The counterfeit coin has a different weight from the other coins but Sally does not kno
ACM OJ上的题目1013:Counterfeit Dollar
SJ has a dozen Voyageur silver dollars.However,only eleven of the coins are true silver dollars; one coin is counterfeit .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.
输入
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.
输出
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.
样例输入
1
ABCD EFGH even
ABCI EFJK up
ABIJ EFGH even 样例输出
K is the counterfeit coin and it is light.
代码如下:
#include
#include
int main()
{
\x05int n;
\x05int t[12]={0};
\x05char c[]="ABCDEFGHIJKL";
\x05char left[5];
\x05char right[5];
\x05char commend[5];
\x05while(scanf("%d",&n))
\x05{
\x05\x05for(int k=0;k

ACM OJ上的题目1013:Counterfeit DollarSJ has a dozen Voyageur silver dollars.However,only eleven of the coins are true silver dollars; one coin is counterfeit .The counterfeit coin has a different weight from the other coins but Sally does not kno
#include
#include
int main()
{
int n;
int t[12]={0};
char c[]="ABCDEFGHIJKL";
char left[5];
char right[5];
char commend[5];
scanf("%d",&n);
while(n--)
{
memset(t,0,sizeof(t));
for(int k=0;k

ACM OJ上的题目1013:Counterfeit DollarSJ has a dozen Voyageur silver dollars.However,only eleven of the coins are true silver dollars; one coin is counterfeit .The counterfeit coin has a different weight from the other coins but Sally does not kno acm刷什么oj好 C++代码 输出格式问题 (zjut acm oj上的题目)我在做大数加这道题目,代码改了一个下午,我认为算法应该是没问题,但是格式有问题.先来看下题目吧:大数加 Time Limit:1000MS Memory Limit:32768KDescripti 谁有数据结构的算法跟POJ题目的对应关系其他的OJ也可以,就是像线性表、栈、队列、树、图之类的跟OJ上题目的对应 在acm里面,有哪个关于分组背包的oj题,要求每组恰好需要选一个物品的吗?请告诉我相关oj的题号,要求每组选且只选一个物品. 求ACM各大OJ的解题报告,最好是经过整理分类的,希望有大家提交的所有代码(估计不现实了.没后台.) 题目是each day count 的作文 鄙人正在做ACM试题,请问现在有哪些大学有OJ? 求一道acm的题:给你一个文件里面有71k的数字,要你把这些数字压缩之后交上去,这是哪个oj的题啊?rt 北大oj上的一道题,哪位高手有兴趣解答下,感激不尽 http://poj.org/problem?id=1008 count,count和count的区别 英文(ACM题目)的中文翻译去哪找最好! ACM解题报告我想要一个ACM的题型总结,最好 题 都是北大平台上的比如:标明题号( 最好都是北大平台上的题目)动态规划:标明题号. ACM 请问:北京大学acm 上 “方程的解数” 最好有源代码. acm stars题目意思是什么 ACM斐波那契数列超时我一共编写了两个程序,但是在学校OJ(南邮)上还是超时了,程序本身没有错,但是占用内存太大,希望个位帮我改进,如下:1#include stdio.hint main(){int s=0,f=1,F=0,n;do{scanf(%d,&n);}wh 英语翻译在做北大ACM上的题目,可是全英文真的受不了,google翻译真的很DT.有木有谁的博客上、或者自己翻译了题目,球给个连接. zjut acm oj 1786 一个圆上有n(n是偶数)个不同的点,每个点需要和其他一个点连成一条线段.线段两两之间没有交点的连接方法称为“No X”.给定一个n,求出有多少种“No X”的连接方法.递归或公