http://acm.hdu.edu.cn/showproblem.php?pid=2176
第三种博弈,但一定要注意优化时间
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1273 Accepted Submission(s): 760
1 #include<iostream> 2 #include<algorithm> 3 using namespace std; 4 int main() 5 { 6 int n,i,t,k; 7 int a[200005]; 8 while(~scanf("%d",&n)&&n!=0) 9 { 10 t=0; 11 for(i=0;i<n;i++) 12 { 13 scanf("%d",&a[i]); 14 t=t^a[i]; 15 } 16 if(t!=0) 17 { 18 printf("Yes\n"); 19 for(i=0;i<n;i++) 20 { 21 k=t^a[i];//怎样优化时间 22 if(k<a[i]) 23 printf("%d %d\n",a[i],k); 24 } 25 } 26 else 27 printf("No\n"); 28 } 29 return 0; 30 }
原文:http://www.cnblogs.com/cancangood/p/3514443.html