sdut 2161 Simple Game(山东省第二届acm省赛A题)（博弈论Nim+Bush?）

最新推荐文章于 2020-06-30 12:20:52 发布

艾尔森

最新推荐文章于 2020-06-30 12:20:52 发布

阅读量657

点赞数 1

分类专栏： acm省赛文章标签： c++ acm 算法

本文链接：https://blog.csdn.net/l769255844/article/details/71087520

版权

Simple Game

Time Limit: 1000MS Memory Limit: 65536KB

Problem Description

Here is a simple game. In this game, there are several piles of stones and two players. The two players play in turn. In each turn, one can choose at least one pile and at most three piles to take away arbitrary number of stones from the pile (Of course the number of stones, which is taken away, cannot be zero and cannot be larger than the number of stones in the chosen pile). If after a player ′ s turn, there is no stone left, the player is the loser.
Suppose that the two players are all very smart. Your job is to tell whether the player who plays first can win the game or not.