A Multiplication Game + 博弈

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

李逝水

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

阅读量493

点赞数

CC 4.0 BY-SA版权

分类专栏：博弈

本文链接：https://blog.youkuaiyun.com/wenlovingliu/article/details/8965071

博弈专栏收录该内容

17 篇文章

订阅专栏

Stan与Ollie在一场独特的游戏中竞争，通过连续的整数乘法来达到或超过给定的目标值n。他们从1开始，交替进行乘法操作，直到某人赢得比赛。本文提供了一个简单的算法解决方案，帮助理解如何确定谁将赢得这场智力竞赛。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A Multiplication Game

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

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 <iostream>
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;
}