当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2505: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.

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2505

最后修改于 2020-10-29T06:34:22+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 65536