「POJ2505」A multiplication game

2014年3月10日3,7620

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

162

34012226

Sample Output

Stan wins.
Ollie wins.
Stan wins.

Stan wins.

Ollie wins.

Stan wins.

题解

分析:

0-9:stan

10-18:ollie

19-162:stan

163-324:ollie

规律:

9 = 9

18 =2*9

162 = 9*2*9

324 = 2*9*2*9

……

由此可以发现胜负分界点的规律

#include<iostream>
#include<cstdio>
using namespace std;
double n;
int main()
{
	while(scanf("%lf",&n)!=EOF)
	{
		while(1)
		{
			if(n<=9){printf("Stan wins.\n");break;}
			else if(n<=18){printf("Ollie wins.\n");break;}
			n/=18;
		}
	}
	return 0;
}