用C语言编写的搬山小游戏。



游戏说明：

设有n座山，计算机与人为比赛的双方，轮流搬山。规定每次搬山的数止不能超 过k座，谁搬最后一座谁输。游戏开始时。计算机请人输入山的总数(n)和每次允许搬山的最大数止(k)。然后请人开始，等人输入了需要搬走的山的数目后，计算机马上打印出它搬多少座山，并提示尚余多少座山。双方轮流搬山直到最后一座山搬完为止。计算机会显示谁是赢家，并问人是否要继续比赛。若人不想玩了，计算机便会统计出共玩了几局，双方胜负如何。-C language prepared by the removal of small hills game. Game Note : There n mountains, computer and the two competitions were staged to move mountains. Stipulated to move mountains just a few blocks of not more than k, who moved last one who lost. At the beginning of the game. Please computer importing Hill, the number (n) and allow each to move mountains for the largest number (k). Then begin importing such as the need to move the mountains of numbers, the computer print out immediately how much it moved mountains. and prompts the remaining number of mountains. The two sides take turns moving mountains until the last load up a hill. The computer will show who is a winner, and asked whether to continue with the race. If the people do not want to play, the computer will play with the statis