http://acm.hdu.edu.cn/showproblem.php?pid=2509
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1646 Accepted Submission(s): 879
1 #include<iostream> 2 #include<algorithm> 3 using namespace std; 4 int main() 5 { 6 int n,i,a[50]; 7 int temp,ans; 8 while(~scanf("%d",&n)) 9 { 10 temp=0; 11 ans=-1; 12 for(i=0;i<n;i++) 13 { 14 scanf("%d",&a[i]); 15 if(i==0) 16 ans=a[i]; 17 else 18 ans=ans^a[i]; 19 if(a[i]>1) 20 temp=1; 21 } 22 if(temp==0) 23 { 24 if(n%2==1) 25 printf("No\n"); 26 else 27 printf("Yes\n"); 28 } 29 else 30 { 31 if(ans==0) 32 printf("No\n"); 33 else 34 printf("Yes\n"); 35 36 } 37 } 38 return 0; 39 }
原文:http://www.cnblogs.com/cancangood/p/3512825.html