HDU 1850 Being a Good Boy in Spring Festival(sg函数)

先暴力出sg函数来，会发现sg(x) = x,然后枚举每一种走法，看看异或结果是否为0。因为temp^temp = 0，所以这样可以直接判断。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int n;
int p[101];
int main()
{
    int i,temp,ans,num;
    while(scanf("%d",&n)!=EOF)
    {
        ans = 0;
        if(!n) break;
        for(i = 1; i <= n; i ++)
        {
            scanf("%d",&p[i]);
            ans ^= p[i];
        }
        num = 0;
        if(ans == 0)
            printf("0\n");
        else
        {
            for(i = 1; i <= n; i ++)
            {
                temp = ans;
                temp ^= p[i];
                if(p[i] >= temp)
                num ++;
            }
            printf("%d\n",num);
        }
    }
    return 0;
}