Nim-K or Moore's Nim ?
思路来自 http://hi.baidu.com/andimeo/item/e0427a4c2945b1eca4c06607
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int t;
scanf("%d",&t);
while(t--){
int n,value;
int sum[24]={0};
scanf("%d",&n);
int i;
for(i=0;i<n;i++){
scanf("%d",&value);
for(int j=0;j<24;j++){
sum[j]+=value&1;
value>>=1;
}
}
for(i=0;i<24;i++)
if(sum[i]%4!=0)
break;
if(i==24)
printf("No\n");
else
printf("Yes\n");
}
return 0;
}
/**************************************
Problem id : SDUT OJ 2161
Result : Accepted
Take Memory : 448K
Take Time : 20MS
Submit Time : 2014-04-25 22:33:49
**************************************/