fjnu 1550 A multiplication game

Description

Stan and Ollie play the game of multiplication by multiplying an integer p by one of the numbers 2 to 9. Stan always starts with p = 1, does his multiplication, then Ollie multiplies the number, then Stan and so on. Before a game starts, they draw an integer 1 < n < 4294967295 and the winner is who first reaches p >= n.

Input

Each line of input contains one integer number n.

Output

For each line of input output one line either
Stan wins.
or
Ollie wins.
assuming that both of them play perfectly.

Sample Input

162
17
34012226

Sample Output

Stan wins.
Ollie wins.
Stan wins.

 

KEY:好抽象的数学问题……算法是网上搜的……丢人……

当输入为N时，如果Stan在能赢，则说明之前的一轮Ollie无论出多少都不能赢。设当乘积为M且该Ollie发难（设Ollie出p）时,Stan有必赢的策略（不管Ollie出什么，Stan都出9）,即
    9×M＜N,9×p×M≥N    （p≥2）
    等价于M≥ceil（N / （2×8））    （ceil为向上取整）
下面证明如果Stan在ceil（N/18）时有必赢的策略，则
    9×ceil（N/18）＜N且18×ceil（N/18）≥N.
设N = 18×k + r （k≥1，0≤r＜18）代人上式即得。
（在10到18之间，Ollie必赢，可手工验证。）

接着验证若Stan在ceil（N/18）时必输，则Stan在N时亦必输。只要Ollie出2，Stan即使出9也不能赢，Ollie接着出9，即赢。

Source:

# include  < iostream >
# include  < cmath >
using   namespace  std;

int  StanWin(unsigned  long   int  n)
... {
    if (2<=n&&n<=9)
    ...{
        return 1;
    } 
    if (n<2)
    ...{
        return 0;
    } 
    if(n>9)
    ...{
        return StanWin(ceil(n/18.0));
    }
}

int  main()
... {
//    freopen("fjnu_1550.in","r",stdin);
    unsigned long int n;
    while (cin>>n)
    ...{
        if (StanWin(n))
            cout<<"Stan wins."<<endl;
        else
            cout<<"Ollie wins."<<endl;
    }
    return 0;
}