Description: 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.
To Search:
File list (Check if you may need any files):
banshan.cpp
Download