[博弈游戏]Euclid's Game(0099)-SWUST_OJ
2016-04-02 21:13
295 查看
Description
Starts with two unequal positive numbers (M,N and M>N) on the board. Two players move in turn. On each move, a player has to write on the board a positive number equal to the difference of two numbers already on the board; this number must be new, i.e.,
different from all the numbers already on the board. The player who cannot move loses the game. Should you choose to move first or second in this game?
According to the above rules, there are two players play tihs game. Assumptions A write a number on the board at first, then B write it.
Your task is write a program to judge the winner is A or B.
Two unequal positive numbers M and N , M>N (M<1000000)
A or B
3 1
A
利用欧几里得算法将求出最大公约数,而又有规律可知结果与m的奇偶性有关系,使m,n互质,再根据规律得出A还是B会赢得这次比赛
Starts with two unequal positive numbers (M,N and M>N) on the board. Two players move in turn. On each move, a player has to write on the board a positive number equal to the difference of two numbers already on the board; this number must be new, i.e.,
different from all the numbers already on the board. The player who cannot move loses the game. Should you choose to move first or second in this game?
According to the above rules, there are two players play tihs game. Assumptions A write a number on the board at first, then B write it.
Your task is write a program to judge the winner is A or B.
Two unequal positive numbers M and N , M>N (M<1000000)
A or B
3 1
A
#include<iostream> using namespace std; int main() { int m, n, c,x,y; cin >> m >> n; x = m; y = n; while (y) { c = x%y; x=y; y = c; } m /= x; if (m % 2) cout << "A" << endl; else cout << "B" << endl; return 0; }
利用欧几里得算法将求出最大公约数,而又有规律可知结果与m的奇偶性有关系,使m,n互质,再根据规律得出A还是B会赢得这次比赛
相关文章推荐
- 书评:《算法之美( Algorithms to Live By )》
- 动易2006序列号破解算法公布
- Ruby实现的矩阵连乘算法
- C#插入法排序算法实例分析
- 超大数据量存储常用数据库分表分库算法总结
- C#数据结构与算法揭秘二
- C#冒泡法排序算法实例分析
- 算法练习之从String.indexOf的模拟实现开始
- C#算法之关于大牛生小牛的问题
- C#实现的算24点游戏算法实例分析
- c语言实现的带通配符匹配算法
- 浅析STL中的常用算法
- 算法之排列算法与组合算法详解
- C++实现一维向量旋转算法
- Ruby实现的合并排序算法
- C#折半插入排序算法实现方法
- 基于C++实现的各种内部排序算法汇总
- C++线性时间的排序算法分析
- C++实现汉诺塔算法经典实例
- PHP实现克鲁斯卡尔算法实例解析