# Be the Winner

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3246    Accepted Submission(s): 1814

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

//
//  main.cpp
//  HDU2509
//
//  Created by teddywang on 2016/8/29.
//

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int T,m,n;
int main()
{
while(cin>>n)
{
int c[200];
int ans=0,flag=0;
for(int i=0;i<n;i++)
{
cin>>c[i];
ans^=c[i];
if(c[i]>1) flag++;
}
if((ans&&flag>=1)||(ans==0&&flag==0)) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}

#### Be the Winner( HDU2509)Nim博弈

2017-12-26 21:06:03

#### HDU 2509 Be the Winner nim博弈

2014-10-26 22:24:07

#### HDU2509:Be the Winner(Nim)

2013-12-16 20:41:22

#### 博弈之Nim浅谈

2015-12-18 15:23:48

#### Nim博弈及其扩展

2015-09-21 17:10:04

#### HDU2509 Be the Winner 博弈

2012-01-10 10:30:36

#### hihocoder #1173 : 博弈游戏·Nim游戏·三

2017-04-08 12:02:09

#### Misere Nim （Nim博弈）

2016-04-14 09:24:05

#### hihocoder 1172 博弈游戏·Nim游戏·二

2015-07-25 15:46:44

#### Nim博弈与SG函数

2015-05-14 22:21:45