2161Euclid's Game

2161   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 eitherStan winsorOllie winsassuming that both of them play perfectly. The last line of input contains two zeroes and should not be processed.
输入样例 复制
34 12
15 24
0 0
输出样例 复制
Stan wins
Ollie wins

说明

5
13
通过提交
时空限制1000ms/128mb
题目来源
评测方式在线评测
题目类型
难        度