hdu1517找规律

挺像巴什博弈的，直接递推就能找到规律了，从2开始到9，s win，10到18，o win，18到162，s win，一直向下推进

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<cassert>
#include<iomanip>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pi acos(-1)
#define ll long long
#define mod 1000000007
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

const double g=10.0,eps=1e-9;
const int N=1000000+10,maxn=111117,inf=11111;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n;
    while(cin>>n){
        ll s=9,flag=1;
        while(s<n){
            if(flag==1)s*=2;
            else s*=9;
            flag=-flag;
        }
        if(flag==1)cout<<"Stan wins."<<endl;
        else cout<<"Ollie wins."<<endl;
    }
    return 0;
}