hdu 2509 博弈 *

多堆的情况要处理好孤单堆

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<cstring>
 #include<cmath>
 #include<queue>
 #include<map>
 using namespace std;
 #define MOD 1000000007
 const int INF=0x3f3f3f3f;
 const double eps=1e-;
 typedef long long ll;
 #define cl(a) memset(a,0,sizeof(a))
 #define ts printf("*****\n");
 const int MAXN=;
 int n,m,tt;
 int main()
 {
     int i,j,k,ca=;
     #ifndef ONLINE_JUDGE
     freopen("1.in","r",stdin);
     #endif
     while(scanf("%d",&n)!=EOF)
     {
         int temp=;
         int a;
         int ans;
         for(i=;i<n;i++)
         {
             scanf("%d",&a);
             if(i==)
             {
                 ans=a;
             }
             else ans^=a;
         }
         if(ans==)
            printf("No\n");
         else
            printf("Yes\n");
     }
 }