Game of stones hackerrank solution

Please Login in order to post a comment.

Two players called and are playing a game with a starting number of stones. Player always plays first, and the two players move in alternating turns. The game's rules are as follows:. Given the starting number of stones, find and print the name of the winner. Each player plays optimally, meaning they will not make a move that causes them to lose the game if a winning move exists. For example, if , can make the following moves:. Complete the gameOfStones function in the editor below.

Game of stones hackerrank solution

Alice and Bob are playing the game of Nim with piles of stones with sizes. If Alice plays first, she loses if and only if the ' xor sum' or 'Nim sum' of the piles is zero, i. Since Bob already knows who will win assuming optimal play , he decides to cheat by removing some stones in some piles before the game starts. However, to reduce the risk of suspicion, he must keep at least one pile unchanged. Your task is to count the number of ways Bob can remove the stones to force Alice into losing the game. Since the number can be very large, output the number of ways modulo. Assume that both players will try to optimize their strategy and try to win the game. The first line of the input contains an integer denoting the number of piles. The next line contains space-separated integers indicating the sizes of the stone piles. Print a single integer denoting the number of ways Bob can force Alice to lose the game, modulo. The answer is. The four possible resulting lists of piles is:. Note that is not allowed since he must keep one pile unchanged.

You will be notified via email once the article is available for improvement.

The one who is not able to make the move loses the game. In other words, the player who removes the last set of stones always wins. 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. Skip to content.

Two players called and are playing a game with a starting number of stones. Player always plays first, and the two players move in alternating turns. The game's rules are as follows:. Given the starting number of stones, find and print the name of the winner. Each player plays optimally, meaning they will not make a move that causes them to lose the game if a winning move exists.

Game of stones hackerrank solution

The one who is not able to make the move loses the game. In other words, the player who removes the last set of stones always wins. 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. Skip to content. Change Language. Open In App. Solve Coding Problems. Water Game Number of matches required to find the winner Maximum no. Game of stones.

Rock road county jail

Game of Chocolates Wythoff's Game. Previous Check whether two numbers are in silver ratio. The four possible resulting lists of piles is: Note that is not allowed since he must keep one pile unchanged. Please read our cookie policy for more information about how we use cookies. The game's rules are as follows:. Similar Reads. We use cookies to ensure you have the best browsing experience on our website. Help us improve. You will be notified via email once the article is available for improvement. Contribute to the GeeksforGeeks community and help create better learning resources for all. Solve Coding Problems. If , can make any of the following three moves:. Explore offer now. Last Updated : 02 Nov,

It is a two-player game that requires players to take turns to move stones from one pile to another. The aim of the game is to end up with all the stones in one pile. It is a great problem that tests your skills in programming logic and problem-solving.

If , removes stones and wins the game. Change Language. Sort by recency. Share your thoughts in the comments. What kind of Experience do you want to share? Similar Reads. In other words, the player who removes the last set of stones always wins. Sample Output 1. Please read our cookie policy for more information about how we use cookies. If , can't make any moves and loses the game.