hdu 2509 Be the Winner(博弈Nim)

Be the Winner

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 2509

Appoint description:  System Crawler  (Jul 27, 2016 2:21:44 PM)

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
这题与以往的博弈题的胜负条件不同，谁走完最后一步谁输
所以在以往尼姆博弈输出上稍加修改就行了
#include<stdio.h>
int a[105];
int main()
{
    int i,ans,n,temp;
    while(scanf("%d",&n)!=EOF)
    {
        temp=0;//孤单堆
        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            if(i==0)
                ans=a[i];
            else
                ans=ans^a[i];
            if(a[i]>1)  temp=1;
        }
        if(temp==0)
        {
            if(n%2==1)
               printf("No\n");
            else
               printf("Yes\n");
            continue;
        }         
        if(ans==0)
           printf("No\n");
        else
           printf("Yes\n");
    }    
    return 0;
}