GAME31 - The game of 31
The game of 31 was a favourite of con artists who rode the railroads in days of yore. The game
is played with a deck of 24 cards: four labelled each of 1, 2, 3, 4, 5, 6. The cards in the deck are
visible to both players, who alternately withdraw one card from the deck and place it on a pile.
The object of the game is to be the last player to lay a card such that the sum of the cards in
the pile does not exceed 31. Your task is to determine the eventual winner of a partially played
game, assuming each player plays the remainder of the game using a perfect strategy.
For example, in the following game player B wins:
Player A plays 3
Player B plays 5
Player A plays 6
Player B plays 6
Player A plays 5
Player B plays 6
The input will consist of several lines; each line consists of a sequence of zero or more digits
representing a partially completed game. The rst digit is player A's move; the second player
B's move; and so on. You are to complete the game using a perfect strategy for both players
and to determine who wins.
For each game, print a line consisting of the input, followed by a space, followed by A or B to
indicate the eventual winner of the game.
getline gave me a couple of wa :/
brute force solution passes in the given time limit
please explain i/o... is there blank line after every input?? Do we have to process a blank line?? Should we print a blank line after every case o/p ??
nice problem. learnt a lot about game theory...:)
@skmiiita case 3: (current sum: 20; to get 31-required 11 to finish) player A will play 4 making current sum 24, player B can only make sum of 25-30(with cards 1-6), so player A can make it 31 and finish.Last edit: 2012-08-15 05:29:24
can anyone explain case 3.
Buda IM (retired):
Please clear out IO matters. Are there empty lines between every test case, and should we print the empty lines after each output.
should the output for zero digits be:" A"
shouldn't be output of 4th and 5th example be B wins??