HDU5011 Game(Nim博弈）

最新推荐文章于 2019-03-19 22:33:18 发布

zoe_ed

最新推荐文章于 2019-03-19 22:33:18 发布

阅读量363

点赞数

分类专栏：博弈文章标签：博弈 HDU Nim

本文链接：https://blog.csdn.net/zyd8888102/article/details/71270236

版权

这是一个两人博弈游戏，开始时有多堆珠子，玩家轮流选择一堆并移除至少一个珠子，也可将其分成两堆非零珠子。若某玩家无法进行操作则输。对于所有给定的测试案例，需要判断先手玩家是否能获胜。当先手面对奇异局势时，无论其如何操作，都无法阻止对手进入奇异局势，因此会输。

摘要由CSDN通过智能技术生成

Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 437 Accepted Submission(s): 340

Problem Description
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 l