设有n座山，计算机与人作为比赛的双方，双方轮流搬山。规定每次搬山的数目不能超过k座，谁搬最后一座谁输。游戏开始时，计算机请人输入山的总数(n)和每次允许搬山的最大数目(k)。然后请人先开始，人输入了需要搬走的山的数目后，计算机马上输出它搬多少座山，并提示尚余多少座山。双方轮流搬山直到最后一座山搬完为止。计算机显示谁是赢家，并问人是否要继续比赛。若人不想玩了，可以输入山的总数为0，计算机便会告诉人共完了几局，双方胜负如何。-With n mountains, computers and people on both sides as the game, the two sides take turns to move mountains. Provides the number of each move can not exceed k Hill Block, who moved the last one who loses. When the game starts, the computer asked people to enter the total number of the mountain (n) and each time the maximum number allowed to move mountains (k). And then asked people to begin, people need to move the mountain entered the number, the computer immediately how much output it to move mountains, and prompts the remaining number of mountain. The two sides take turns to move a mountain to move those mountains until the last date. Computer show who is the winner, and asked whether to continue. If people do not want to play, you can enter the total number of mountains is 0, the computer will tell the Council a total of over a few, the outcome of how the two sides.