Description
Here is a simple game. In this game, there are several piles of matches and two players. The two player play in turn. In each turn, one can choose a pile and take away arbitrary number of matches from the pile (Of course the number of matches, which is taken away, cannot be zero and cannot be larger than the number of matches in the chosen pile). If after a player’s turn, there is no match left, the player is the winner. Suppose that the two players are all very clear. Your job is to tell whether the player who plays first can win the game or not.
Input
<
本文介绍了一个名为2234-Matches Game的博弈问题,详细说明了输入和输出格式,并提供了示例输入和输出数据。
最低0.47元/天 解锁文章
2813

被折叠的 条评论
为什么被折叠?



