Nim Game——Difficulty：Easy

Problem :

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.

Example:

**

Algorithm:

**

根据题意，
情况1：四个石头的时候我必输，因为不管我先拿什么，NIM都可以凑出4来。

情况2：考虑n=5时，只要我刚开始拿1块，那么接下来的情况就是：还有四块石头，但是是NIM先拿，所以回到了情况1，所以我必胜。同理当n=6，7.

情况3：n=8，只要NIM根据我的快数凑出两个4块，比如我拿1，他拿3，我再拿2，他拿2，那么他必胜。

综上，当n为4的倍数时，NIM必胜，反之，我必胜。

**

Code：

**

class Solution {public:    bool canWinNim(int n) {        if(n%4==0)            return false;        else            return true;    }};