POJ 2975 Nim <Nim 博弈>

题目：http://poj.org/problem?id=2975

简单的Nim博弈

#include <iostream>#include <cstdio>#include <cstring>using namespace std;int main(){    int n;    int a[1005];    int k,ans;    while(scanf("%d",&n)&&n)    {        memset(a,0,sizeof(a));         k = 0;         ans = 0;        for(int i=0;i<n;i++)        {            scanf("%d",&a[i]);             k^=a[i];        }        for(int i =0;i<n;i++)        {            if(k^a[i] < a[i]) //优先级问题                ans++;        }        printf("%d\n",ans);    }    return 0;}