/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size) for(int i=0 ; i<size ; i++) cin>>array[i] ;
#define new_line pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647
int main()
{
ll n ;
while(cin>>n)
{
int l =0 ;
ll m =9 ;
while(1)
{
if(n<=m)
{
if(l ==0)
pf("Stan wins.\n") ;
else
pf("Ollie wins.\n") ;
break ;
}
else
{
if(l==0)
{
m = m*2 ;
l =1 ;
}
else if(l==1)
{
m = m*9 ;
l =0 ;
}
}
}
}
return 0;
}
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size) for(int i=0 ; i<size ; i++) cin>>array[i] ;
#define new_line pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647
int main()
{
ll n ;
while(cin>>n)
{
int l =0 ;
ll m =9 ;
while(1)
{
if(n<=m)
{
if(l ==0)
pf("Stan wins.\n") ;
else
pf("Ollie wins.\n") ;
break ;
}
else
{
if(l==0)
{
m = m*2 ;
l =1 ;
}
else if(l==1)
{
m = m*9 ;
l =0 ;
}
}
}
}
return 0;
}
No comments:
Post a Comment