Nim Game

You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the winner. You will take the first turn to remove the stones.

Both of you are very clever and have optimal strategies for the game. Write a function to determine whether you can win the game given the number of stones in the heap.

For example, if there are 4 stones in the heap, then you will never win the game: no matter 1, 2, or 3 stones you remove, the last stone will always be removed by your friend.

和另一名小伙伴一起做游戏，双方交替从一堆石子中取出至少一个之多3个石子，不能不取，取走最后一颗石子者获胜。（中文果然短。。。）

bool canWinNim(int n) {
    if(n < 4 || (n-1)%4==0 || (n-2)%4==0 || (n-3)%4==0) return true;
    else return false;
}

代码很简单，解释清楚也不麻烦。如果想要自己获胜，那么除非自己能够一次取完，也就是n<3的时候 或者能够给对方留下4个石子。每个回合自己均能保证取走4个石子，无论对方取走几个。所以这类题是可以预先知道游戏结果的。看了一下 Nim游戏百科小游戏背后的东西可不少。