21397_TheGameof31

2022-5-16 18:19| 发布者: Hocassian| 查看: 45| 评论: 0|原作者: 肇庆学院ACM合集

摘要:
C:\Users\Administrator\Downloads\2019-10-12-10-14-4-89505231255400-Problem List-采集的数据-后羿采集器.html

Pro.ID

21397

Title

The Game of 31

Title链接

http://10.20.2.8/oj/exercise/problem?problem_id=21397

AC

24

Submit

31

Ratio

77.42%

时间&空间限制

  • Time Limit: 1000/500 MS (Java/Others)     Memory Limit: 65536/65536 K (Java/Others)
  • 描述

    The game of 31 was a favorite of con artists who rode the railroads in days of yore. The game is played with a deck of 24 cards: four labeled 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 stratefy.

    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 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.

    输出

    Description

    The game of 31 was a favorite of con artists who rode the railroads in days of yore. The game is played with a deck of 24 cards: four labeled 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 stratefy.

    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

    Input

    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.

    Output

    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.

    Sample Input

    356656
    35665
    3566
    111126666
    552525

    Sample Output

    356656 B
    35665 B
    3566 A
    111126666 A
    552525 A

    Source

    样例输入

    356656
    35665
    3566
    111126666
    552525

    样例输出

    356656 B
    35665 B
    3566 A
    111126666 A
    552525 A

    作者


    路过

    雷人

    握手

    鲜花

    鸡蛋

    最新评论

    返回顶部