发表文章

[最新] hdu -> acm -> A Multiplication Game

desporado 1月前 0

A Multiplication Game

Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 2   Accepted Submission(s) : 2
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 &lt; n &lt; 4294967295 and the winner is who first reaches p &gt;= n.<br>
 

Input
Each line of input contains one integer number n.<br>
 

Output
For each line of input output one line either <br><br>Stan wins. <br><br>or <br><br>Ollie wins.<br><br>assuming that both of them play perfectly.<br>
 

Sample Input
162
17
34012226
 

Sample Output
Stan wins.
Ollie wins.
Stan wins.
 

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;

__int64 p,n,count1;
int main()
{
    while(scanf("%I64d",&n)!=EOF)
    {
        count1=0;
        p=1;
        while(true)
        {
            if(p>=n)break;
            count1++;
            if(count1&1)p*=9;
            else p*=2;
        }
        printf("%s\n",count1&1?"Stan wins.":"Ollie wins.");
    }
    return 0;
}

相关推荐
最新评论 (0)
返回
发表文章
desporado
文章数
84
评论数
0
注册排名
655514