HDU 1525 Euclid's Game
来源:互联网 发布:mysql update 关联表 编辑:程序博客网 时间:2024/06/05 03:36
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.
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 12
15 24
0 0
Sample Output
Stan wins
Ollie wins
题意
题目给出了两个正数a.b
每次操作,大的数减掉小的数的整数倍。一个数变为0 的时候结束。
谁先先把其中一个数减为0的获胜。问谁可以赢。Stan是先手。
题解
如果a%b==0.就是a是b的倍数,那么一定是先手获胜。
如果a>=2*b. 那么 那个人肯定知道a%b,b是必胜态还是必败态。如果是必败态,先手将a,b变成a%b,b,那么先手肯定赢。如果是必胜态,先手将a,b变成a%b+b,b.那么对手只有将这两个数变成a%b,b,先手获胜。
如果是b
CODE:
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <cmath>using namespace std;int main(){ long long a,b; while(scanf("%lld%lld",&a,&b)!=EOF&&a&&b) { bool flag=0; while(1) { if(a<b) swap(a,b); if(a%b==0||a>=2*b) { flag? printf("Ollie wins\n"):printf("Stan wins\n"); break; } flag=!flag; a-=b; } } return 0;}
- hdu 1525 Euclid's Game
- hdu 1525 Euclid's Game
- HDU 1525 - Euclid's Game
- hdu 1525 Euclid's Game
- HDU(1525)Euclid's Game
- HDU 1525 Euclid's Game
- hdu 1525 Euclid's Game
- HDU 1525 Euclid’s Game
- hdu 1525 Euclid's Game
- HDU-1525-Euclid's Game
- HDU 1525 Euclid's Game
- HDU 1525 Euclid's Game (博弈)
- hdu 1525 Euclid's Game 博弈
- [简单博弈] hdu 1525 Euclid's Game
- hdu 1525 Euclid's Game 博弈
- HDU 1525 Euclid's Game 博弈
- HDU 1525 Euclid's Game (博弈)
- HDU 1525 Euclid's Game 博弈
- java源码中的生词摘录成有道词典单词本
- UML类图与类的关系详解
- hibernate和mybatis的区别
- Intent+SharedPreferences在活动中传递数据
- 分布式事务--XA 解决多个数据源操作
- HDU 1525 Euclid's Game
- 1.2.2实现Runnable接口
- titleinfo.html
- Web项目集成FineReport
- 架构师之路-创业互联网公司如何搭建自己的技术架构
- linux下配置squid 服务器,最简单使用方式
- 关于Cookie的添加/修改/删除操作体验(C#)
- 机器学习中的必修数学(十)
- Git使用小结