1889: A multiplication game
Result | TIME Limit | MEMORY Limit | Run Times | AC Times | JUDGE |
---|---|---|---|---|---|
3s | 8192K | 322 | 114 | Standard |
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;
}