poj 2505 A multiplication game （博弈+找规律）

最新推荐文章于 2023-06-11 16:48:17 发布

clover_hxy

最新推荐文章于 2023-06-11 16:48:17 发布

阅读量372

点赞数

分类专栏：博弈问题

本文链接：https://blog.youkuaiyun.com/clover_hxy/article/details/53856773

版权

博弈问题专栏收录该内容

36 篇文章

订阅专栏

A multiplication game

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6073		Accepted: 3037

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

[Submit] [Go Back] [Status] [Discuss]

题解：博弈+找规律

[1,9] 先手胜；[10,18] 后手胜；[19,162]先手胜...

这是有规律的区间的右端点是*9*2*9*2*9*一直循环的。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
	long long n;
	while (scanf("%I64d",&n)!=EOF) {
		long long p=1;
		for (int i=1;i;i++) {
			if (i&1) p*=9;
			else p*=2;
			if (p>=n) {
				if (i&1) printf("Stan wins.\n");
				else printf("Ollie wins.\n");
				break;
			} 
		}
	}
}