21331_Euclid'sGame

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

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

Pro.ID

21331

Title

Euclid's Game

Title链接

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

AC

35

Submit

78

Ratio

44.87%

时间&空间限制

  • Time Limit: 600/200 MS (Java/Others)     Memory Limit: 131072/65536 K (Java/Others)
  • 描述

    Two players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of the lesser of the two numbers from the greater of the two numbers, provided that the resulting number must be nonnegative. Then Ollie, the second player, does the same with the two resulting numbers, then Stan, etc., alternately, until one player is able to subtract a multiple of the lesser number from the greater to reach 0, and thereby wins. For example, the players may start with (25,7):
             25 7
             11 7
              4 7
              4 3
              1 3
              1 0
    an Stan wins.

    输入

    The input consists of a number of lines. Each line contains two positive integers giving the starting two numbers of the game. Stan always starts.

    输出

    Description
    Two players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of the lesser of the two numbers from the greater of the two numbers, provided that the resulting number must be nonnegative. Then Ollie, the second player, does the same with the two resulting numbers, then Stan, etc., alternately, until one player is able to subtract a multiple of the lesser number from the greater to reach 0, and thereby wins. For example, the players may start with (25,7):
             25 7
             11 7
              4 7
              4 3
              1 3
              1 0
    an Stan wins.
    Input
    The input consists of a number of lines. Each line contains two positive integers giving the starting two numbers of the game. Stan always starts.
    Output
    For each line of input, output one line saying either Stan wins or Ollie wins assuming that both of them play perfectly. The last line of input contains two zeroes and should not be processed.
    Sample Input
    34 12
    15 24
    0 0
    Sample Output
    Stan wins
    Ollie wins
    Source

    样例输入

    34 12
    15 24
    0 0

    样例输出

    Stan wins
    Ollie wins

    作者


    路过

    雷人

    握手

    鲜花

    鸡蛋

    最新评论

    返回顶部