1013.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

#include <stdio.h>

int main( ) {
	char w[3][2][10], temp[10];
	char c;
	int r[3], n, i, k, j, a, b;

	scanf( "%d", &n );
	while( n-- ) {
		for( i=0; i<3; i++ ) {
			scanf( "%s%s%s", w[i][0], w[i][1], temp );
			if( temp[0] == 'e' )
				r[i] = 0;
			else if( temp[0] == 'u' )
				r[i] = -1;
			else
				r[i] = 1;
		}

		for( c='A'; c<='L'; c++ ) {
			for( k=-1; k<=1; k+=2 ) {
				for( i=0; i<3; i++ ) {
					a = b = 0;
					for( j=0; w[i][0][j]; j++ )
						if( w[i][0][j] == c )
							a = k;
					for( j=0; w[i][1][j]; j++ )
						if( w[i][1][j] == c )
							b = k;
					if( b - a != r[i] )
						break;
				}
				if( i == 3 )
					goto ans;
			}
		}
ans:
		printf( "%c is the counterfeit coin and it is %s.\n", c, (k==-1)?"light":"heavy" );
	}
	return 0;
}