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.

 

 

题意：给出了两个正数a.b,每次操作，大的数减掉小的数的整数倍。一个数变为0 的时候结束。

谁先先把其中一个数减为0的获胜。问谁可以赢。Stan是先手。

题解：没想太多打表过的。。

正确题解：

如果a==b.那么肯定是先手获胜。一步就可以减为0,b

如果a%b==0.就是a是b的倍数，那么也是先手获胜。

如果a>=2*b.  那么 那个人肯定知道a%b,b是必胜态还是必败态。如果是必败态，先手将a,b变成a%b,b,那么先手肯定赢。如果是必胜态，先手将a,b变成a%b+b,b.那么对手只有将这两个数变成a%b,b,先手获胜。

如果是b<a<2*b  那么只有一条路：变成a-b,b  (这个时候0<a-b<b).这样一直下去看谁先面对上面的必胜状态。

所以假如面对b < a <2*b的状态，就先一步一步走下去。直到面对一个a%b==0 || a >=2*b的状态。

#include<bits/stdc++.h>

#define N 35

#define mes(x) memset(x, 0, sizeof(x));

#define ll __int64

const long long mod = 1e9+;

const int MAX = 0x7ffffff;

using namespace std;

int dfs(int n, int m){

    if(n > m) swap(n,m);

    if(n >= *m) return ;

    if(n == )

        return ;

    for(int i=m%n;i<m;i += n){

        if(dfs(n, i) == )

            return ;

    }

    return ;

}

int main()

{

    int n, m;

    while(~scanf("%d%d", &n, &m)&&(n||m))

        printf("%s\n", dfs(n,m)?"Stan wins":"Ollie wins");

}