Be the Winner

最新推荐文章于 2019-08-16 22:23:38 发布

原创最新推荐文章于 2019-08-16 22:23:38 发布 · 122 阅读

0 ·

CC 4.0 BY-SA版权

博弈论专栏收录该内容

8 篇文章

订阅专栏

本文探讨了在特定苹果堆游戏中应用反尼姆博弈策略的方法。通过分析苹果堆的排列和数量，玩家可以制定出必胜策略。文章提供了一个算法实现示例，展示了如何计算在不同情况下的获胜可能性。

题目

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

一道反尼姆博弈！

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string.h>
#include <string>
typedef long long ll;
#define INF 0x3f3f3f3f
using namespace std;
ll x;
int main() {
	int n, num, ans, k;
	while (cin >> n && n) {
		num = 0;
		ans = 0;
		while (n--) {
			cin >> x;
			if (x >= 2) num++;
			ans ^= x;
		}
		if ((ans != 0 && num != 0) || (ans == 0 && num == 0))  cout << "Yes" << endl;
		else cout << "No" << endl;
	}
	return 0;
}