HDU1525 Euclid's Game (找规律博弈)
来源:互联网 发布:流行网络用语文言文 编辑:程序博客网 时间:2024/06/05 01:09
Euclid's Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3434 Accepted Submission(s): 1599
Problem Description
Two players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of the lesser of the two numbers from the greater of the two numbers, provided that the resulting number must be nonnegative. Then Ollie, the second player, does the same with the two resulting numbers, then Stan, etc., alternately, until one player is able to subtract a multiple of the lesser number from the greater to reach 0, and thereby wins. For example, the players may start with (25,7):
25 7
11 7
4 7
4 3
1 3
1 0
an Stan wins.
25 7
11 7
4 7
4 3
1 3
1 0
an Stan wins.
Input
The input consists of a number of lines. Each line contains two positive integers giving the starting two numbers of the game. Stan always starts.
Output
For each line of input, output one line saying either Stan wins or Ollie wins assuming that both of them play perfectly. The last line of input contains two zeroes and should not be processed.
Sample Input
34 1215 240 0
Sample Output
Stan winsOllie wins
Source
University of Waterloo Local Contest 2002.09.28
思路:题目让求的是用大的数减去小的数,能够使得其中的一个数变成0的人为胜者。首先来分析下,假设a>=b,如果a==b 或者a%b==0则先手为胜,当a>=2*b时,则可以判断(a%b,b)是必胜点或者必败点,如果是必败点则可以走到这点,如果是必胜点则可以走到(a%b+b,b),当a < 2*b,则可以通过 a-=b计算
#include <cstdio>#include <algorithm>using namespace std;int a,b;int main(){while(~scanf("%d%d",&a,&b)){if(a==0&&b==0)break;if(a < b)swap(a,b);int flag = 0;while(b){if(a%b == 0 || a / b >= 2)break;a -= b;swap(a,b);flag = !flag;}if(flag)printf("Ollie wins\n");elseprintf("Stan wins\n");}return 0;}
0 0
- HDU1525 Euclid's Game (找规律博弈)
- hdu1525-------Euclid's Game 找规律
- hdu1525 Euclid's Game 找规律
- hdu1525 Euclid's Game 博弈
- hdu1525 Euclid's Game , 基础博弈
- HDU1525 Euclid's Game(博弈)
- POJ2348 UVa10368 HDU1525 Euclid's Game【博弈】
- HDU1525 Euclid's Game
- hdu1525 Euclid's Game
- POJ 2348 Euclid's Game (博弈找规律 )
- HDU 1525 Euclid's Game (博弈、找规律)*
- HDU 1525 Euclid's Game【博弈 PN找规律】
- HDU 1525 Euclid's Game 找规律博弈
- hdu 1525 Euclid's Game (博弈规律)
- hdu 1525 || poj 2348 Euclid's Game(博弈找规律)
- hdu 1525 Euclid's Game(博弈——找规律)
- 基础博弈论之——简单的博弈问题【hdu1525】【Euclid‘s Game】
- Euclid's Game---博弈
- 踏进性能测试的路,踩遍各种性能的坑
- 如何用R画折线图,散点图,平滑曲线图
- Android4.4中不能发送SD卡就绪广播
- 【软考】设计模式-桥接模式
- 二分贪心 D
- HDU1525 Euclid's Game (找规律博弈)
- Qt快速入门第三版章节3.2.3标准对话框练习
- HBase Java API 使用示例
- 【POJ 2506 Tiling】+ dp
- C3D:视频动作分类demo实现
- split空值问题
- 使用spring AOP事务的时候报错的原因
- Android数据存储于IO
- 【JavaEE】The Introduce of 'JSF'