回过头看HDU 5011 Game（2014西安区域赛）

最新推荐文章于 2020-05-04 06:38:49 发布

Cymbals

最新推荐文章于 2020-05-04 06:38:49 发布

阅读量228

点赞数

分类专栏：博弈论 ACM 文章标签： NIm ACM Java

本文链接：https://blog.csdn.net/Cymbals/article/details/79335894

版权

ACM 同时被 2 个专栏收录

143 篇文章 0 订阅

订阅专栏

博弈论

8 篇文章 0 订阅

订阅专栏

Here is a game for two players. The rule of the game is described below:

● In the beginning of the game, there are a lot of piles of beads.

● Players take turns to play. Each turn, player choose a pile i and remove some (at least one) beads from it. Then he could do nothing or split pile i into two piles with a beads and b beads.(a,b > 0 and a + b equals to the number of beads of pile i after removing)

● If after a player’s turn, there is no beads left, the player is the winner.

Suppose that the two players are all very clever and they will use optimal game strategies. Your job is to tell whether the player who plays first can win the game.
Input
There are multiple test cases. Please process till EOF.

For each test case, the first line contains a postive integer n(n < 10 5) means there are n piles of beads. The next line contains n postive integer, the i-th postive integer a i(a i < 2 31) means there are a i beads in the i-th pile.
Output
For each test case, if the first player can win the game, ouput “Win” and if he can’t, ouput “Lose”

Sample Input
1
1
2
1 1
3
1 2 3

Sample Output
Win
Lose
Lose

这水题出在一堆那么难的题里真是迷……

题目大意是几堆珠子，每次一名玩家挑选任意一堆，取走任意数目，然后可以把这一堆里剩下的珠子随意分成两堆或不分。

一开始我在网上查的时候看到一种游戏叫“Take or break game”，就是这题里提到的游戏（拿取x，然后再拿合理的任意值（可为0）组成新的一堆），有一篇博客的里提到了这个名词，并表示应该需要用SG函数来解。

然而事实上，这题的代码可短了，跟poj 2234几乎一模一样，而2234这题就是最经典的nim游戏，n堆，选一堆随便拿。也就是说，增加的“分成两堆”动作对游戏局面产生的影响是0。

代码…..贴不贴呢，贴吧：

public class Main {
    public static void main(String[] args) {
        Scanner reader = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        while (reader.hasNext()) {
            int n = reader.nextInt();
            long ans = 0;
            for (int i = 1; i <= n; i++) {
                ans ^= reader.nextInt();
            }
            if (ans == 0) {
                out.println("Lose");
            } else {
                out.println("Win");
            }
        }
        out.close();
    }
}