1740.txt

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

#include <stdio.h>
#include <algorithm>
int a[10];

int main()
{
	int n,i,key;

	while( 1 )
	{
		scanf("%d",&n);
		if( n == 0 ) break;

		for( i=0; i<n; i++ )
			scanf( "%d",&a[i] );

		if( n%2 ) key=1;
		else 
		{
			std::sort( a, a+n );
			for( i=0; i<n; i+=2 )
				if( a[i] != a[i+1] ) break;

			if( i >= n ) key = 0;
			else key = 1;
		}
		printf( "%d\n", key );
	}

	return 0;
}