Nim Game

来源:互联网 发布:ip网络功放作用 编辑:程序博客网 时间:2024/05/16 19:37

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个石头,谁最后一个移除桌子上的所有石头谁就赢了,你可以第一次移除。


解题如下:

bool canWinNim(int n) {
       return (n%4) ? true:false;
    }

0 0
原创粉丝点击