HDU 2509 Be the Winner

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

【题目分析】

简单的NIM游戏啊（请自行百度（划去）知乎）

【代码】

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int n;
while(~scanf("%d",&n)){
int i,j;
int s=0;bool flag=0;
for(i=1;i<=n;i++){
scanf("%d",&j);
s^=j;
if(j>1)flag=1;
}
if(!flag) if(n%2) printf("No\n");
else printf("Yes\n");
elseif(s==0)printf("No\n");
else printf("Yes\n");
}
return 0;
}