8.2.7 Be the Winner

Be the Winner

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

Total Submission(s): 38 Accepted Submission(s): 29

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

anti-nim跟上一篇一样

http://www.cnblogs.com/cssystem/p/3204826.html

#include <cmath>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cstdlib>
using namespace std;

const int maxn=210;
int n,ans,T,x;
bool flag;

void close()
{
exit(0);
}


void init()
{
    while(scanf("%d",&n)!=EOF)
    {
        flag=false;
        scanf("%d",&ans);
        if (ans>1) flag=true;
        for (int i=2;i<=n;i++)
        {
            scanf("%d",&x);
            if (x>1) flag=true;
            ans=ans ^ x;
        }
        if (not flag) //全部是1
        {
            if (n % 2==0)
                printf("Yes
");
            else
                printf("No
");
        }
        else
        {        
            if (ans!=0)
                printf("Yes
");
            else
                printf("No
");
        }
    }
}

int main ()
{
    init();
    close();
    return 0;
}