HDU

A Multiplication Game

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5975 Accepted Submission(s): 3391

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 < n < 4294967295 and the winner is who first reaches p >= n.

Input
Each line of input contains one integer number n.

Output
For each line of input output one line either

Stan wins.

or

Ollie wins.

assuming that both of them play perfectly.

Sample Input
162
17
34012226

Sample Output
Stan wins.
Ollie wins.
Stan wins.

简单的推一下必胜，必败就知道了，比如有一个n，那么(n-1)/9到n-1都是必胜，那显然，(n-1)/9在除以2到它本身这个区间就都是必败了，然后一直除，最后看看1到底落在那个区间。但是这题最牛逼的是输出最后还有一个’.’，让我debug了10分钟！

#include<bits/stdc++.h>using namespace std;int main(){    long long n;    while(cin>>n)    {        n--;        while(1)        {            n/=9;            if(n<1)            {                cout<<"Stan wins."<<endl;break;            }            n/=2;            if(n<1)            {                cout<<"Ollie wins."<<endl;break;            }        }    }}