Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:一个通过的思路

Posted by xihongshidelove at 2007-12-16 18:03:29 on Problem 1013
In Reply To:Re:一个通过的思路 Posted by:cpp0600548268 at 2006-02-28 11:43:32
> 我用的也是这个思路 为什么不对呢?
> #include<iostream>
> #include<cmath>
> using namespace std;
> 
> const int NumOfDollar = 12;
> 
> void main()
> {
> 	int num;                              
> 	char left[3][7] = {'\0'}, right[3][7] = {'\0'}, result[3][5] = {'\0'};
>     static int dollar[NumOfDollar], rdollar[NumOfDollar];
> 	int i, k, j;
> 	char c;
> 
> 	cin>>num;
> 
> 	for(k = 0; k < num; k++){
> 		for(j = 0; j < 3; j++)
> 			cin>>left[j]>>right[j]>>result[j];
> 		
> 		for(i = 0; i < 3; i++){
> 			c = result[i][0];
> 		    switch(c){
> 				case 'u':	for(j = 0; left[i][j] != '\0'; j++){
> 					            dollar[left[i][j] - 'A']++;
> 								dollar[right[i][j] - 'A']--;
> 							}
> 							break;
> 				case 'd':	for(j = 0; left[i][j] != '\0'; j++){
> 								dollar[left[i][j] - 'A']--;
> 								dollar[right[i][j] - 'A']++;
> 							}
> 					        break; 
> 				case 'e':  for(j = 0; left[i][j] != '\0'; j++){
> 								rdollar[left[i][j] - 'A'] = 1;
> 								rdollar[right[i][j] - 'A'] = 1;
> 						   }
> 						   break;
> 			}
> 		}
> 
> 		int index;
>         for(i = 0; rdollar[i] == 1; i++);   index = i;
>     	for(; i < NumOfDollar; i++){
> 			if(rdollar[i] == 0){
> 			     if(abs(dollar[i]) > abs(dollar[index]))   index = i;
> 			}
> 		}
> 		if(dollar[index] > 0)   cout<<(char)('A' + index)<<" is the counterfeit coin and it is heavy."<<endl;
> 		else                    cout<<(char)('A' + index)<<" is the counterfeit coin and it is light."<<endl;
> 	}
> }

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator