题目

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.

Example:

1
2
3
4
5
6

Input: 4
Output: false
Explanation: 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.

分析

此题目中的问题的解释可分为当问题可以被4整除的时候都无法赢得游戏,如果不能被4整除的时候只要最后将数字归的4以下就可以赢。

C语言代码

1
2
3
4
5
6
7
8
bool canWinNim(int n) {
bool canWinNim(int n) {
if(n%4==0)
return false;
else
return true;
}
}

相关内容

小游戏