HDU 1517 - A Multiplication Game

最新推荐文章于 2020-05-04 11:11:13 发布

原创最新推荐文章于 2020-05-04 11:11:13 发布 · 475 阅读

0 ·

CC 4.0 BY-SA版权

HDU 同时被 2 个专栏收录

23 篇文章

订阅专栏

博弈

11 篇文章

订阅专栏

Stan和Ollie进行了一场独特的乘法游戏，通过不断乘以2到9之间的数字来争夺胜利。文章深入探讨了如何通过数学策略决定胜者，涉及区间上限和最优游戏策略的分析。

A Multiplication Game

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

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

Sample Output

  
   Stan wins.
Ollie wins.
Stan wins.

====================================

思路：http://www.cnblogs.com/kuangbin/archive/2011/08/29/2158581.html

区间上限=先手不断*9，后手不断*2

#include <iostream>
#include <cstdio>

using namespace std;

int main()
{
    double n;
    while(~scanf("%lf",&n))
    {
        while(n>18)
        {
            n/=18;
        }
        if(n<=9)
        {
            cout<<"Stan wins."<<endl;
        }
        else
        {
            cout<<"Ollie wins."<<endl;
        }
    }
    return 0;
}