0
点赞
收藏
分享

微信扫一扫

A Multiplication Game 1517 (博弈+规律)

您好 2023-04-25 阅读 74


A Multiplication Game


Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4477 Accepted Submission(s): 2530



Problem 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.



#include<stdio.h>
#include<math.h>
int main()
{
	double n;
	while(scanf("%lf",&n)!=EOF)
	{
		while(n>18)
			n/=18;
		if(n>9)
			printf("Ollie wins.\n");
		else
			printf("Stan wins.\n");
	}
	return 0;
}



举报

相关推荐

0 条评论