NUC1445 Euclid's Game【博弈】

Euclid's Game

时间限制: 1000ms 内存限制: 65535KB

问题描述

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 711 74 74 31 31 0

an Stan wins.

输入描述

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.

输出描述

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.

样例输入

34 12
15 24
0 0

样例输出

Stan wins
Ollie wins

来源

Waterloo local 2002.09.28

问题分析：（略）

这个问题和《POJ2348 UVa10368 HDU1525 Euclid's Game【博弈】》是同一个问题，代码拿过来用就AC了。

程序说明：参见参考链接。

参考链接：POJ2348 UVa10368 HDU1525 Euclid's Game【博弈】

题记：程序做多了，不定哪天遇见似曾相识的。

AC的C++程序如下：

/* POJ2348 UVa10368 HDU1525 Euclid's Game */  #include <iostream>  using namespace std;  int main()
{  int a, b;  while(cin >> a >> b && (a || b)) {  bool Stanwins = true;  if(a < b)  swap(a, b);  while(b) {  if(a % b == 0 || a / b > 1)  break;  a = a - b;  swap(a, b);  Stanwins = !Stanwins;  }  if(Stanwins)  cout << "Stan wins" << endl;  else  cout << "Ollie wins" << endl;  }  return 0;
}

NUC1445 Euclid's Game【博弈】相关推荐

HDU 1525 - Euclid's Game ( 博弈 )
题意 Stan和Ollie玩游戏,Stan先手.给出两个数字,可以用大数减去小数的整数倍,要求不能减到小于0.谁先将一个数字减到0,谁获胜. 思路博弈假设 a > b 比赛的时候想到了关于a ...
POJ - 2348 Euclid's Game(博弈)
题目链接:点击查看题目大意:给出初始的两个数字,每一次操作都要在规则下进行:令较大的数减去任意倍较小的数,必须保证不能出现负数,先减到零者获胜,问谁能获胜题目分析:这个题目说是博弈我感觉更像是找规 ...
POJ 2348 Euclid's Game（博弈）题解
题意:有a,b两个数字,两人轮流操作,每次可以选择两个之中较小的数字,然后另一个数字减去选择数字的任意倍数(不能减到负数),直到其中一个为0,不能操作为败思路:这题用博弈NP思想,必败点和必胜点之间 ...
HDU1525 Euclid's Game 【欧几里得博弈】
有两个玩家,Stan 和 Ollie, 在玩游戏.初始有两个自然数.Stan是先手,每次把大的数字减去小的数字的任意倍数,但是不能使数字变成负数.然后Ollie进行同样的操作,直到有一个玩家使一个数字 ...
【 HDU - 1525 】Euclid's Game（较难找规律，玄学博弈，分析必败点必胜点）
题干: Two players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, su ...
Bzoj 4147: [AMPPZ2014]Euclidean Nim(博弈)
4147: [AMPPZ2014]Euclidean Nim Time Limit: 1 Sec Memory Limit: 256 MB Description Euclid和Pythagoras在 ...
组合博弈游戏 - SG函数和SG定理
转载来自:http://blog.csdn.net/luomingjun12315/article/details/45555495 在介绍SG函数和SG定理之前我们先介绍介绍必胜点与必败点吧. 必胜 ...
[xiaoyi和你飞]博弈基础 ——[AB]
问题虫洞: A - Calendar Game 黑洞内窥: 两个人游戏,给出一个初始日期(介于1900.1.1~2001.11.4), 每个人轮流移动一步,移动规则遵循两条: 1,可以转移到当前日期的 ...
Game Theory: 公平博弈
Notes: The following excerpt is from a book <GAME THEORY>by Thomas && S.Ferguson and a ...

NUC1445 Euclid's Game【博弈】

NUC1445 Euclid's Game【博弈】相关推荐

最新文章

热门文章