hdu1517 A Multiplication Game

最新推荐文章于 2021-10-07 09:05:49 发布

相知无悔

最新推荐文章于 2021-10-07 09:05:49 发布

阅读量832

点赞数

分类专栏： hdu 博弈

本文链接：https://blog.csdn.net/mengzhengnan/article/details/11992989

版权

hdu 同时被 2 个专栏收录

188 篇文章 1 订阅

订阅专栏

博弈

67 篇文章 1 订阅

订阅专栏

A Multiplication Game

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

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.
  
  
  
  
   
   这题 我们想,如果,n不断的除成了一个小于9的数m,那么第一个人只需要第一步变成m,以后,不论第二个人乘k,他只要乘18/k,那么,最后一定是第一个人赢,相反,也是一个道理,所以,这题,可以很容易的得出结论!

#include <iostream>
#include <stdio.h>
using namespace std;

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