Problem 1927 --Problem E: A multiplication game

1927: Problem E: A multiplication game

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $2$ 正确数量 $2$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签

Problem E: A multiplication game

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. Each line of input contains one integer number n. For each line of input output one line either

Stan wins.

or

Ollie wins.

assuming that both of them play perfectly.

162
17
34012226
Stan wins.
Ollie wins.
Stan wins.

推荐代码 查看1927 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$0 $ms] 淡意的温柔 589789 2020-06-01 15:00:20
内存最少[$944 $KB] AOJ大管家 84442 2017-04-27 15:29:47
第一AC AOJ大管家 84442 2017-04-27 15:29:47
第一挑战 AOJ大管家 84442 2017-04-27 15:29:47

赛题来源/所属竞赛 NA N/A

竞赛编号 竞赛名称 竞赛时间 访问比赛