HDU 2509 Be the Winner

Be the Winner

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 3306    Accepted Submission(s): 1843


Problem Description

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).

 

Input

You 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.

 

Output

If 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

 

Source

ECJTU 2008 Autumn Contest

 

Recommend

lcy   |   We have carefully selected several similar problems for you:  2516 2512 1850 2510 2515 

典型的尼姆博弈，简单的博弈。

ac代码：

#include <stdio.h>

int main()
{
int n,ans,num,flag;

while(~scanf("%d",&num))
{
ans=0;
flag=0;
while(num--)
{
scanf("%d",&n);
ans^=n;
if(n>1)
flag=1;
}
if(flag)
{
if(!ans)
printf("No\n");
else
printf("Yes\n");
}
else
{
if(n%2==1)
printf("Yes\n");
else
printf("No\n");
}
}

return 0;
}