1889: A multiplication game

1889: A multiplication game


ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE
3s8192K322114Standard
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. Each line of input contains one integer number n. For each line of input output one line either
Stan wins.
or
Ollie wins.
assuming that both of them play perfectly. There should be one more blank line at the end of your output.

Sample input

162
17
34012226

Output for sample input

Stan wins.
Ollie wins.
Stan wins.

 


 

 

#include<iostream>
using namespace std;
int check(long long n)
{
    if(n<=18&&n>9) return 1;
    else if(n<=9&&n>1) return 0;
    if(n%9==0) n=n/9;
    else n=n/9+1;
    if(n%2==0) n=n/2;
    else n=n/2+1;
    return check(n);
}

int main()
{
    long long n;
    while(cin>>n)
    {
        if(check(n)==1)  cout<<"Ollie wins."<<endl;
        else cout<<"Stan wins."<<endl;
    }
    cout<<endl;
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值