A Multiplication Game

Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 102   Accepted Submission(s) : 54

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

1621734012226

 

Sample Output

Stan wins.Ollie wins.Stan wins.

 

Source

University of Waterloo Local Contest 2001.09.22

 

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;__int64 a[18];int main(){    __int64 n,i;    memset(a, 0, sizeof(a));    a[0] = 1;    for (int i = 1; i <= 17; i++ )    {        if (i % 2 == 1) a[i] = a[i - 1] * 9;        else a[i] = a[i-1] * 2;    }    while (scanf("%I64d", &n) != EOF)    {        for (int i = 1; i <= 17; i++)        {            if (a[i] >= n)            {                    if (i % 2 == 1){ printf("Stan wins.\n"); }                else printf("Ollie wins.\n");                break;            }        }                }    return 0;}