3128.txt

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

Source

Problem Id:3128  User Id:fzk 
Memory:40K  Time:0MS
Language:G++  Result:Accepted

Source 

#include <stdio.h>

int main( ) {
	int t, n, i, c, j;
	char w[100];
	bool s[100];
	int ans[100];

	scanf( "%d%d", &t, &n );

	while( t-- ) {
		scanf( "%s", w );

		for( i=0; i<26; i++ ) {
			s[i] = false;
			w[i]-='A';
			ans[i+1] = 0;
		}

		for( i=0; i<26; i++ ) {
			if( !s[i] ) {
				s[i] = true;
				for( j=w[i], c=1; j!=i; j=w[j], c++ )
					s[j] = true;
				if( !(c&1) )
					ans[c]++;
			}
		}
		for( i=2; i<=26; i++ )
			if( ans[i] & 1 )
				break;
		printf( "%s\n", i<=26?"No":"Yes" );
	}
	return 0;
}