博弈——A Multiplication Game（打表找规律）

博弈——A Multiplication Game（打表找规律）

题目链接：
HDU - 1517

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.

题目大意

两个人玩游戏，Stan先手，p 初始为 1，他们每次可以选择 2 ~ 9 之间的任意一个数与 p 相乘，当所得的数大于或等于 n 时，则获胜。

分析

可以先找找规律
0 ~ 9 Stan wins.
10 ~ 9 * 2 Ollie wins.
19 ~ 9 * 2 * 9 Stan wins.

从上面我们可以看出，必胜者总会乘以9，让自己尽量大去取到 n，必败者总会乘以 2，来尽量阻止必胜者取到 n，所以我们可以将 n 不断地除以 18，直到其小于 18 为止，这样，我们就可以判断谁输谁赢了。

#include<bits/stdc++.h>
using namespace std;

int main()
{
	double n;
	while(cin>>n){
		while(n>18){
			n/=18;
		}
		if(n<=9){
			cout<<"Stan wins."<<endl;
		}
		else{
			cout<<"Ollie wins."<<endl;
		}
	}
	return 0;
}