首页 > 代码库 > hdu 1517 A Multiplication Game 段sg
hdu 1517 A Multiplication Game 段sg
A Multiplication Game
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3832 Accepted Submission(s): 2183
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.
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
没有想到应该这样分析.....
打了sg表...1 肯定必败 (2,9)必胜 (10,18)必败,(19,36)必胜...总之就是((2*9)^i+1,(2*9)^i*9)必败
#include <cstdio>#include <cstring>using namespace std;long long n;int main(){ while(scanf("%I64d",&n)!=EOF){ long long tn=1; bool fl=false; while(n>tn){ tn*=9;fl=true; if(n<=tn)break; tn*=2;fl=false; } if(fl)printf("Stan wins.\n"); else printf("Ollie wins.\n"); } return 0;}
hdu 1517 A Multiplication Game 段sg
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。