Given an integer N which is the number of stones in a pile and the game of stones is being played between you and your friend, the task is to find whether you’ll win or not. A player (on his/her turn) can remove 1 or 2 or 3 coins, the game continues in alternating turns. The one who is not able to make the move loses the game. In other words, the player who removes last set of coins always wins. Print YES if you can win the game else print NO.
Input: N = 4
If there are 4 stones in the bag, 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. Hence, you are not able to make the move.
Input: N = 3
Yes you can win the game, you just remove all 3 stones in your turn.
- First consider base cases, i.e for n = [1, 2, 3]. In these cases you always win as you can pick all stone and your friend is not able to make the move.
- If n = 4, you will lose. Because no matter how many you take, you will leave some stones behind for your friend to take and win the game. So in order to win, you have to ensure that you never reach the situation where there are exactly four stones left when your turn comes up.
- Similarly, if there are 5, 6, or 7 stones you can win by taking just enough to leave 4 stones for your friend. But if there are 8 stones on the pile, you will lose because regardless whether you pick 1, 2 or 3 stones, your friend can pick 3, 2 or 1 stone to ensure that, again, 4 stones will be left for you .
- It is obvious that the same pattern repeats, so, if n % 4 == 0 then you will always lose.
Below is the implementation of the above approach:
- Water Game
- Even-odd turn game with two integers
- Minimum Players required to win the game
- Maximize big when both big and small can be exchanged
- Minimum value to be added to X such that it is at least Y percent of N
- Numbers of Length N having digits A and B and whose sum of digits contain only digits A and B
- Absolute difference between the first X and last X Digits of N
- Count Odd and Even numbers in a range from L to R
- Cost of painting n * m grid
- Check if a binary string contains consecutive same or not
- Smallest integer greater than n such that it consists of digit m exactly k times
- Increasing sequence with given GCD
- Check if a + b = c is valid after removing all zeroes from a, b and c
- Count of pairs of (i, j) such that ((n % i) % j) % n is maximized