Pro.ID21331 TitleEuclid's Game Title链接http://10.20.2.8/oj/exercise/problem?problem_id=21331 AC35 Submit78 Ratio44.87% 时间&空间限制描述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 作者 |