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
- Find sum of factorials in an array
- Find the sum of digits of a number at even and odd places
- Count the number of currency notes needed
- Print the first and last character of each word in a String
- Program to calculate product of digits of a number
- Length of the smallest number which is divisible by K and formed by using 1's only
- Check if it is possible to create a polygon with given n sides
- Find the area of the shaded region formed by the intersection of four semicircles in a square
- Replace array elements by sum of next two consecutive elements
- Find the hypotenuse of a right angled triangle with given two sides
- Program to find the time after K minutes from given time
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.