HDU 1850 - Being a Good Boy in Spring Festival

Nimm博弈，需要统计可行方案的个数。

代码如下：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int ways[102];
int main()
{
#ifdef test
freopen("input.txt", "r", stdin);
#endif
int m;
while(scanf("%d", &m) && m!=0)
{
int sum = 0;
for(int i=0; i<m; ++i)
{
scanf("%d", &ways[i]);
sum ^= ways[i];
}
if(sum == 0)
printf("0\n");
else
{
int ans = 0;
for(int i=0; i<m; ++i)
if(ways[i] > (sum^ways[i]))// 关键
++ans;
printf("%d\n", ans);
}
}
return 0;
}