poj 2505 A multiplication game（博弈）

A multiplication game

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5622		Accepted: 2811

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.

Source

Waterloo local 2001.09.22

【思路】

博弈

2<=n<=9，先手必胜

10<=n<=18，先手必败

19<=n<=162，先手必胜

163<=n<=324，先手必败

…

=-=

【代码】

 #include<cstdio>

 int main() {
     double n;
     while(scanf("%lf",&n)==) {
         while(n>) n/=;
         if(n<=) puts("Stan wins.");
         else puts("Ollie wins.");
     }
     return ;
 }