HDU2509 Be The Winner

标签：can   tput   mat   app   group   single   VID   otherwise   spl   

InputYou will be given several cases. Each test case begins with a single number n (1 <= n <= 100), followed by a line with n numbers, the number of apples in each pile. There is a blank line between cases. 
OutputIf a winning strategies can be found, print a single line with "Yes", otherwise print "No". 
Sample Input

2
2 2
1
3

Sample Output

No
Yes
题解：考虑全为一的情况
参考代码：

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int n,ans,val,cnt;
 4 int main() 
 5 {
 6     while(~scanf("%d",&n))
 7     {
 8         ans=cnt=0;
 9         for(int i=1;i<=n;++i){ scanf("%d",&val),ans^=val;if(val>1) cnt++; }
10         if((!ans&&cnt>1)||(ans&&!cnt)) puts("No");
11         else puts("Yes");
12     } 
13     
14     return 0;
15 }

View Code

HDU2509 Be The Winner

标签：can   tput   mat   app   group   single   VID   otherwise   spl   

原文地址：https://www.cnblogs.com/songorz/p/10331490.html