POJ 1740 A New Stone game (Multi-heap game-finding law)

Transmission Door

//there are n heaps, and AB shifts from the heap of n heaps to any of them, can be thrown away, or can be moved to a bunch of other heaps//the first to move out of the win//if the number of 22 piles in the n heap is equal, it must be B-win .//but as long as there are not 22 of the same, like Xyz,a first,//A can be moved from the largest heap (z) y-x to the X heap, YYP, eventually remove p must be a#include <iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespacestd;intMain () {intn,a[ the];  while(SCANF ("%d", &n) &&N) {intaa,res=0, maxn=0; Memset (A,0,sizeof(a));  for(intI=0; i<n;i++) {scanf ("%d",&AA); MAXN=Max (MAXN,AA); A[AA]++; }         for(intI=0; i<=maxn;i++)        {            if(a[i]%2==1) {res=1;  Break; }} printf ("%d\n", RES); }    return 0;}

POJ 1740 A New Stone game (Multi-heap game-finding law)