ACM 1013 Counterfeit Dollar

原创 2013年12月05日 14:57:19
Counterfeit Dollar
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 37015   Accepted: 11837

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. 

#include <stdio.h>
#include <string.h>

typedef struct{
	char str_1[6];
	char str_2[6];
	char adj[6];
}STR;

STR str[3];

void Init()
{
	int i, j;
	for(i=0; i < 3; i++)
	{
		for(j=0; j < 6;j++)
		{
			str[i].str_1[j]='\0';	
			str[i].str_2[j]='\0';
			str[i].adj[j]='\0';
		}
	}
}

void GetData()
{
	int i;
	for(i = 0; i < 3; i++)
	{
		scanf("%s %s %s", str[i].str_1, str[i].str_2, str[i].adj);	
	}
}
 
void Adj()
{
	int adjData[3], flag=1;
	int count_length=0, i, j, k;
	char data;
	
	for(data='A'; data <= 'L'; data++)
	{
		flag=1;
		for(k=0; k < 3 && flag;k++)
		{

			if(strcmp(str[k].adj,"even")==0){
				for(i=0; i<6; i++)
					if(str[k].str_1[i]!='\0')
						if(data==str[k].str_1[i])
						{ 
							flag=0;
							break;
						}
				if(i==6){
					for(j=0; j < 6; j++)
						if(str[k].str_2[j]!='\0')
							if(data==str[k].str_2[j])
							{ 
								flag=0;
								break;
							}
				}
			}else if(strcmp(str[k].adj,"up")==0){
				for(i=0;i < 6; i++)
					if(str[k].str_1[i]!='\0') 	
						if(data==str[k].str_1[i])
						{
							adjData[count_length++]=1;	
							break;
						}
				if(i==6){
					for(j=0; j < 6; j++)
						if(str[k].str_2[j]!='\0')
							if(data==str[k].str_2[j]){
								adjData[count_length++]=-1;
								break;
							}
				}
				if(i==6 && j==6){
					flag=0;
					break;
				}		
			}else if(strcmp(str[k].adj,"down")==0){
				for(i=0;i < 6; i++)
					if(str[k].str_1[i] != '\0') 	
						if(data==str[k].str_1[i]){
							adjData[count_length++]=-1;	
							break;
						}
				if(i==6){
					for(j=0; j < 6; j++)
						if(str[k].str_2[j] != '\0')
							if(data==str[k].str_2[j]){
								adjData[count_length++]=1;
								break;
							}
				}
				if(i==6 && j==6){
					flag=0;
					break;
				}
			}
		}
		if(flag){
			if(count_length==1){
				printf("%c is the counterfeit coin and it is %s.\n", data, adjData[0]==1?"heavy":"light");
				break;
			}else if(count_length==2 && adjData[0]==adjData[1]){
				printf("%c is the counterfeit coin and it is %s.\n", data, adjData[0]==1?"heavy":"light");
				break;
			}else if(count_length==3 && adjData[0]==adjData[1] && adjData[0]==adjData[2]){
				printf("%c is the counterfeit coin and it is %s.\n", data, adjData[0]==1?"heavy":"light");
				break;
			}
		}
		count_length=0;
	}
}
 
int main()
{	

	int n;
//	freopen("input.txt","r",stdin);

	scanf("%d\n", &n);
	
	while(n > 0)
	{
		Init();
		GetData();
		Adj();
		n--;
	}
//	fclose(stdin);
	return 0;
}



测试法AC

相关文章推荐

Counterfeit Dollar

Link:http://acm.fzu.edu.cn/problem.php?pid=1003 Problem 1003 Counterfeit Dollar Accept: ...

ACM —— 1013 Counterfeit Dollar

解题代码: import java.util.Scanner; public class Main { public static void main(String[] args) {...
  • WYYZ5
  • WYYZ5
  • 2015年09月22日 16:14
  • 218

1013 Counterfeit Dollar

Counterfeit DollarTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 27942Accepted: 87...
  • hqd_acm
  • hqd_acm
  • 2011年02月24日 11:28
  • 691

PKU ACM-1013题 java Counterfeit Dollar

终于AC了,原来我一直以为输入是四个字符,四个字符输入的,晕!不过后来还是就解决了哈哈!好了,开始说正题吧!题意:有12个硬币,其中有一个和其他的硬币重量不一样,然后小X用3次天平称称量这些硬币。输入...
  • BXFTYT
  • BXFTYT
  • 2011年02月27日 02:09
  • 436

POJ1013-Counterfeit Dollar

  • 2011年08月04日 22:58
  • 8KB
  • 下载

poj 1013 Counterfeit Dollar 已知12个球中有1个重量与众不同,用3次找出此球,并判断重量轻重

Counterfeit DollarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27975 Accepted: 8755Desc...

0716 POJ#1013 Counterfeit Dollar

摘要:枚举所有情况,找出符合条件的硬币。
  • M_H5211
  • M_H5211
  • 2017年07月16日 09:43
  • 164

POJ 1013:Counterfeit Dollar

Counterfeit Dollar Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4202...

POJ 1013--Counterfeit Dollar

poj 1013

POJ1013——Counterfeit Dollar

Counterfeit Dollar Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4614...
  • LDUtyk
  • LDUtyk
  • 2017年02月28日 21:45
  • 166
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:ACM 1013 Counterfeit Dollar
举报原因:
原因补充:

(最多只允许输入30个字)