这是一个两个人玩的游戏，玩家轮流往装有一定大小限制的盒子里放石头，每回合放的石头数不超过当前盒内石头数的平方。当无法再放石头的一方输掉游戏。题目要求根据初始状态判断先手玩家是否必胜。通过sg函数实现策略分析，递归解决。具体策略包括：当tmp小于ci时，考虑所有可能情况；当tmp大于等于ci时，递归处理。最后注意输出格式，避免因惯性思维导致错误。
Problem Description
This game is a two-player game and is played as follows:
- There are n boxes; each box has its size. The box can hold up to s stones if the size is s.
- At the beginning of the game, there are some stones in these boxes.
- The players take turns choosing a box and put a number of stones into the box. The number mustn’t be great than the square of the number of stones before the player adds the stones. For example, the player can add 1 to 9 stones if there are 3 stones in the box. Of course, the total number of stones mustn’t be great than the size of the box.
4.Who can’t add stones any more will loss the game.
Give an Initial state of the game. You are supposed to find whether the first player will win the game if both of the players make the best strategy.
Input
The input file contains several test cases.
Each test case begins with an integer N, 0 < N ≤ 50, the number of the boxes.
最低0.47元/天 解锁文章
128
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
