joj1889
来源:互联网 发布:软件企业认证要求 编辑:程序博客网 时间:2024/06/06 04:52
1889: 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. There should be one more blank line at the end of your output.
Sample input
1621734012226
Output for sample input
Stan wins.Ollie wins.Stan wins.
Submit / Problem List / Status / Discuss
这个题目的关键是了解博弈算法当中的关于最大最小策略。这既是一个博弈论的问题又是一个离散数学的问题。
#include <iostream>
#include<stdio.h>
using namespace std;
int main()
{
int n;
while(scanf("%d",&n)==1)
{
int p=1;
while(p<n)
{
p=p*9;
if(p>=n)
{
cout<<"Stan wins."<<endl;
break;
}
p=p*2;
if(p>=n)
{
cout<<"Ollie wins."<<endl;;
break;
}
}
}
cout<<endl;
return 0;
}
- joj1889
- 在struts2.1中使用注解和拦截器实现权限细粒度控制
- isspace <ctype.h> <cctype>
- 解决Android 电子市场 下载,安装时出现“下载XXX出错。设备空间不足”的问题
- 一个简单的C++延迟调用系统
- 本地套接字示例[来源:Advanced Linux Programming]
- joj1889
- JNDI的实现
- windows核心编程<读书笔记一>---重写Onchar函数
- 本人多年经验总结关于网页制作的十大禁忌
- Window.ShowModalDialog 页面的传值
- Android RIL 架构学习总结
- isupper <ctype.h> <cctype>
- 软件架构模式
- FOJ 1879 Air Strike