hdu 2509 Be the Winner (anti-sg,sg函数，sj定理)

 1#include <cstdio>
 2#include <cstring>
 3#include <iostream>
 4#include <algorithm>
 5#include <vector>
 6#include <queue>
 7#include <set>
 8#include <map>
 9#include <string>
10#include <cmath>
11#include <cstdlib>
12#include <ctime>
13#define fst first
14#define sec second
15#define lson l,m,rt<<1
16#define rson m+1,r,rt<<1|1
17#define ms(a,x) memset(a,x,sizeof(a))
18typedef long long LL;
19#define pi pair < int ,int >
20#define MP make_pair

 1using namespace std;
 2const double eps = 1E-8;
 3const int dx4[4]={1,0,0,-1};
 4const int dy4[4]={0,-1,1,0};
 5const int inf = 0x3f3f3f3f;
 6int n;
 7int main()
 8{
 9	#ifndef  ONLINE_JUDGE 
10	freopen("code/in.txt","r",stdin);
11  #endif

 1	while (~scanf("%d",&n))
 2	{
 3	    int sum =  0;
 4	    int cnt = 0 ;
 5	    for ( int i = 1 ; i <= n ; i++)
 6	    {
 7		int x;
 8		scanf("%d",&x);
 9		sum^=x;
10		if (x>1) cnt++;
11	    }
12	    if ((sum==0&&cnt==0)||(sum>0&&cnt>0))
13	    {
14		puts("Yes");
15	    }
16	    else
17	    {
18		puts("No");
19	    }
20	}

1  #ifndef ONLINE_JUDGE  
2  fclose(stdin);
3  #endif
4    return 0;
5}