标签:mis main cat bsp enter for oca idt log
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 6028 | Accepted: 3013 |
Description
Input
Output
Sample Input
162 17 34012226
Sample Output
Stan wins. Ollie wins. Stan wins.
Source
#include<cstdio> double n; int main(){ while(scanf("%lf",&n)!=EOF){ while(n>18) n/=18; if(n<=9) puts("Stan wins."); else puts("Ollie wins."); } }
POJ2505 A multiplication game[博弈论]
标签:mis main cat bsp enter for oca idt log
原文地址:http://www.cnblogs.com/candy99/p/6059819.html