292. Nim Game.cpp

/*
292. Nim Game
Easy

592

1594

Add to List

Share
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:

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.

Solution is easy

Generalize this problem, if total number is n + 1, if we can randomly pick 1 ~ n, we will lose as the
oppontent will be able to take all remaining.
if we can pick from 1 ~ n, number is m * ( n + 1 ), we lose

*/

class Solution {
public:
    bool canWinNim(int n) {
        return n % 4 != 0 ;

    }
};