当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

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


输入解释

The input will consist of several lines; each line consists of a sequence of zero or more digits
representing a partially completed game. The first 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.

输入样例
356656
35665
3566
111126666
552525
输出样例
356656 B
35665 B
3566 A
111126666 A
552525 A

该题目包含在题集 ACM赛制

题目来源 19 June

共提交 3

通过率 100.0%
时间上限 内存上限
1000 MS 128 MB