描述
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.
解：
每次都是我先出手
[1,3]先手赢
[4]后手赢
[5,7]先手赢（先手的可以把这种情况转变成【4】这种情况，此时是先手，则转化上面一组情况的时候就变成后手了）
[8]后手赢
得出规律如下
bool canWinNim(int n) {
if(n%4==0)
return false;
return true;
}
