Back to Category
p020: [Week 06] A multiplication game
Keyword: Miguel Revilla 2002-06-15

Difficulity: 1 | Test Data Sets: 5 (Hidden) | Judging: Traditional Judge
Accepted : 315 Times | Submit :741 Times | Clicks : 2825
Accepted : 220 Users | Submit : 233 Users | Accepted rate : 94%
Time Limit :1000 ms | Memory Limit : 64000 KBytes
Update : 2015-04-24 11:41

Content:

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:help

若題目沒有特別說明,則應該以多測資的方式讀取,若不知如何讀取請參考 a001 的範例程式。
162
17
34012226

Sample Output :

Stan wins.
Ollie wins.
Stan wins.

Hint :

Author :

Miguel Revilla 2002-06-15 (Manager: taskmanager)

  Solve it!   Status Forum

C
C++
JAVA
PASCAL
2987. tests
(0ms, 120KB, 201B)
2963. tests
(0ms, 646KB, 192B)
42094. NSLin
(38ms, 5162KB, 683B)

Program running time may be affected by various factors. Check server system environment information here