Leetcode 292. Nim Game

292. Nim Game

 

Question Editorial Solution

  My Submission

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+1也就是4取余（也就是经过这么样的几轮博弈后），看剩下的石头数是多少，1-3个就是“我”赢，0个就是对方赢。

代码：

#include<cstdio>
using namespace std;

/*******************************提交部分**********************************/ 
class Solution
{
	public:
		bool canWinNim(int n)
		{
			if(n%4>=1&&n%4<=3)
				return true;
			return false;
		}
};
/*************************************************************************/

int main()
{
	Solution S;
	int n;
	scanf("%d",&n);
	bool flag=S.canWinNim(n);
	if(flag)
		printf("Yes\n");
	else
		printf("No\n");
	return 0;
}