A - 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.

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
题意：第一个玩家Stan，从两个数字中的较大者中减去两个数字中较小者的任何正倍数，前提是得到的数字必须是非负的。然后第二个玩家Ollie对两个结果数字做同样的处理，然后交替地，直到一个玩家能够从较大的数字中减去较小数字的倍数，达到0，从而获胜

BZ：思路很清晰啊，，分两种情况。（我们假设b>a）
一、0 < b < 2a; 时，每次都只能减一倍的数，就是胜负在天的意思，减到最后谁是0谁就赢了。
二、b > 2a; 时，先手的Stan就有选择权了，b-a、b-2a、b-3a…此时，先手必胜，没毛病吧？！hhh

int main()
{
    int a, b;
    while(scanf("%d %d", &a, &b) && a && b)
    {
        bool is = false;
        while(1)
        {
            if(a > b)
                swap(a, b);
            if(b%a == 0)
                break;
            if(b < 2*a)//胜负在天
                b-=a;
            else if(2*a < b)//先手必胜
               break;
            is = !is;
        }
        if(!is)
            cout << "Stan wins" << '\n';
        else
            cout << "Ollie wins" << '\n';
    }
    return 0;
}