HDU 2509 Be the Winner 尼姆博弈_the world “winner”and“loser”-CSDN博客

本文介绍了一个名为BetheWinner的游戏博弈问题，玩家轮流从成组的苹果中取走连续的一段，目标是避免取走最后一颗苹果。文章通过示例说明了如何确定先手是否能必胜，并提供了一段C语言代码实现。

Be the Winner

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

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

Sample Output

   
    No
Yes

Source

ECJTU 2008 Autumn Contest

Recommend

lcy | We have carefully selected several similar problems for you: 2516 2512 1850 2510 2515

尼姆博弈，跟2509一样。

#include<stdio.h>
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int a,s=0,count=0;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a);
            s^=a;
            if(a>1)count++;
        }
        if((s&&count)||(!s&&!count))
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}