poj 1740 博弈

#include<cstdio>#include<cstring>#include<algorithm>#define MAX(x,y) ((x)>(y)?(x):(y))using namespace std;int main(){int n,d[16];while(~scanf("%d",&n)&&n){for(int i=0;i<n;i++)scanf("%d",&d[i]);sort(d,d+n);if(n&1)printf("1\n");else{int flag=0;for(int i=0;i<n-1;i+=2)if(d[i]!=d[i+1]){    flag=1;break;}if(flag)printf("1\n");elseprintf("0\n");}}return 0;}