HDU2509 Be The Winner

Posted songorz

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了HDU2509 Be The Winner相关的知识,希望对你有一定的参考价值。

Let‘s consider m apples divided into n groups. Each group contains no more than 100 apples, arranged in a line. You can take any number of consecutive apples at one time. 
For example "@@@" can be turned into "@@" or "@" or "@ @"(two piles). two people get apples one after another and the one who takes the last is 
the loser. Fra wants to know in which situations he can win by playing strategies (that is, no matter what action the rival takes, fra will win). 

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的主要内容,如果未能解决你的问题,请参考以下文章

HDU 2509 Be the Winner(取火柴博弈2)

Hdoj 2509 Be the Winner

HDU Be the Winner [Anti-SG]

maven web项目的web.xml报错The markup in the document following the root element must be well-formed.(代码片段

[Grid Layout] Use auto-fill and auto-fit if the number of repeated grid tracks is not to be def(代码片段

codeforces 782B The Meeting Place Cannot Be Changed+hdu 4355+hdu 2438 (三分)