跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0530. Euclid's Game

  • ID: 536
  • 传统题
  • 1000ms
  • 128MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:待分级
  • 上传者:
  • 待分类
  • 整理状态
  • 难度待定
  • 难度
  • 共享题库
  • 高校与竞赛共享题
  • 英文题面
  • 题目来源
  • 题面语言

Euclid's Game

题目描述

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.

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.

样例 1

输入

34 12
15 24
0 0

输出

Stan wins
Ollie wins

题目来源:fps-zhblue-waterloo-020928.xml;FPS 共享题包,题包内第 2 题。保留原作者与原赛事署名。