poj 2505 A multiplication game（博弈）

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.

Each line of input contains one integer number n.

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

162
17
34012226

Stan wins.
Ollie wins.
Stan wins.

 1 #include<cstdio>
 2 
 3 int main() {
 4     double n;
 5     while(scanf("%lf",&n)==1) {
 6         while(n>18) n/=18;
 7         if(n<=9) puts("Stan wins.");
 8         else puts("Ollie wins.");
 9     }
10     return 0;
11 }