设有n座山，计算机与人为比赛的双方，轮流搬山。规定每次搬山的数止不能超 过k座，谁搬最后一座谁输。游戏开始时。计算机请人输入山的总数(n)和每次允许搬山的最大数止(k)。然后请人开始，等人输入了需要搬走的山的数目后，计算机马上打印出它搬多少座山，并提示尚余多少座山。双方轮流搬山直到最后一座山搬完为止。计算机会显示谁是赢家，并问人是否要继续比赛。若人不想玩了，计算机便会统计出共玩了几局，双方胜负如何。-With n mountains, both computer and human race, take turns to move mountains. Number for each and every move the mountain just can not exceed k Block, who moved last one who lost. Beginning of the game. The computer asked people to enter the total number of hill (n) and each time the maximum number allowed to move mountains just (k). And then asked people to start, and others need to move the mountain entered the number, the computer prints out right away how much it is to move mountains, and prompts the remaining number of hills. Both sides take turns to move a mountain to move those mountains up until the last. The computer will display who are the winners, and asked whether to continue the race. If people do not want to play, and the computer will be out to play with a few statistics bureau, the outcome of how the two sides.