hdu2509 Be the Winner(博弈论---尼姆博弈)

最新推荐文章于 2024-07-27 19:30:00 发布

原创最新推荐文章于 2024-07-27 19:30:00 发布 · 735 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#尼姆博弈

杭电(hdu)OJ题目同时被 2 个专栏收录

50 篇文章

订阅专栏

博弈论

6 篇文章

订阅专栏

本文深入探讨了BetheWinner博弈中的策略分析，通过输入序列判断玩家是否能找到必胜的方法，涉及异或运算和策略应用。

Be the Winner

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

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

尼姆博弈:

获胜情况对先取者进行讨论：

异或结果为0，先取者必败，无获胜方法。后取者获胜；

结果不为0，先取者有获胜的取法。

AC代码:

#include<iostream>
using namespace std;

const int maxn = 101;
int a[maxn];
int i;
int main()
{
    int m;
    int cnt;
    int sum;
    while(cin>>m)
    {
        cnt = 0;
        sum = 0;
        for(i=0;i<m;i++)
        {
            cin>>a[i];
            sum ^= a[i];
            if(a[i] >= 2)
            {
                cnt++;
            }
        }
        if(cnt == 0) //每堆都是1的情况下，奇数先取输
        {
            if(sum % 2 == 0) //偶数赢 
            {
                cout<<"Yes"<<endl;
            }
            else //奇数输 
            {
                cout<<"No"<<endl;
            }
        }
        else 
        {
            if(sum == 0) //奇异局势,先取输
            {
                cout<<"No"<<endl;
            }
            else
            {
                cout<<"Yes"<<endl;
            }
        }
    }
    return 0;
}