Description: 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.
To Search:
File list (Check if you may need any files):
搬山问题.cpp
搬山问题.dsp
搬山问题.dsw
搬山问题.ncb
搬山问题.opt
搬山问题.plg
Download