组合数学编程题取子游戏（简单）Two players alternate in removing either one or two from the pile. The player who remove the last stick is the loser. The opponent remove sticks at the first, then it's your turn. Write a program to determine how many sticks should be
Time limitation: 1 seconds Memory limitation: 64M The game of nim is played as follows. Some number of sticks are placed in a pile. Two players alternate in removing either one or two from the pile. The player who remove the last stick is the loser.
