HDU1525 Euclid's Game
2013-04-22 19:54
267 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1525
题目大意:Stan和Ollie轮流对两个数进行如下操作:大数减去小数的X倍(X>0且结果不可产生负数)让求谁先产生0;
分析:谁先面临多种选择则谁就获胜。
代码:
题目大意:Stan和Ollie轮流对两个数进行如下操作:大数减去小数的X倍(X>0且结果不可产生负数)让求谁先产生0;
分析:谁先面临多种选择则谁就获胜。
代码:
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; int main() { int a,b,total,t; while(scanf("%d%d",&a,&b) && (a||b)) { total = 0; while(1) { if(a < b) t = a,a = b,b = t; if(a/b >=2) break; total++; a %= b; if(a==0) { total++; break; } } if(total%2) cout << "Ollie wins" << endl; else cout << "Stan wins" << endl; } return 0; }
相关文章推荐
- hdu1525 Euclid's Game , 基础博弈
- HDU1525 Euclid's Game(博弈)
- TZC 2414 Euclid's Game
- HDOJ 1525 Euclid's Game 博弈论
- 北大ACM2348——Euclid's Game
- hdu 1525 Euclid's Game 博弈
- hdu 1525 Euclid's Game
- POJ - 2348 Euclid's Game
- POJ 2348 Euclid's Game
- 【poj2348】Euclid's Game
- Euclid's Game(poj2348+博弈)
- [简单博弈] hdu 1525 Euclid's Game
- HDU 1525 Euclid's Game 博弈
- hdu1525-------Euclid's Game 找规律
- POJ 2348 Euclid's Game
- hdu 1525 Euclid's Game
- hdu 1525 || poj 2348 Euclid's Game(博弈找规律)
- poj 2348 Euclid's Game
- Euclid's Game - POJ 2348 博弈论
- hdu1525 Euclid's Game , 基础博弈