Be the Winner
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2423 Accepted Submission(s): 1317
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).
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
题意:有n堆苹果,每次可以取走连续的任意多个,如果取走中间的,剩下的可能会变成两堆,取走最后一苹果的人负。问先手的胜负。
思路:http://blog.csdn.net/acm_cxlove/article/details/7854530见取火柴游戏详解。
AC代码如下:
#include<cstdio>
#include<cstring>
using namespace std;
int n;
int main()
{
int i,j,k,S,ret;
while(~scanf("%d",&n))
{
S=ret=0;
for(i=1;i<=n;i++)
{
scanf("%d",&k);
S^=k;
if(k>=2)
ret++;
}
if(S==0)
{
if(ret==0)
printf("Yes\n");
else
printf("No\n");
}
else
{
if(ret==0)
printf("No\n");
else
printf("Yes\n");
}
}
}