hdu1525&poj2348 Euclid's Game

原创 2018年04月17日 20:54:17
Euclid's Game
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 10195 Accepted: 4153

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

Source

Waterloo local 2002.09.28


题解:orz。。。

每次操作,大的数减掉小的数的整数倍。一个数变为0 的时候结束。

谁先先把其中一个数减为0的获胜。问谁可以赢。Stan是先手。

 

假设两个数为a,b(a>=b)

 

如果a==b.那么肯定是先手获胜。一步就可以减为0,b

如果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<a<2*b  那么只有一条路:变成a-b,b  (这个时候0<a-b<b).这样一直下去看谁先面对上面的必胜状态。

 

所以假如面对b < a <2*b的状态,就先一步一步走下去。直到面对一个a%b==0 || a >=2*b的状态。



代码:

#include <iostream>
#include <string.h>
#include <algorithm>
#include <stdio.h>
using namespace std;

int main()
{
    int a,b;
    while(scanf("%d%d",&a,&b)==2)
    {
        if(a==0||b==0)break;
        if(a<b)swap(a,b);
        bool flag=true;
        while(1)
        {
            if(a==b || a/b>=2)break;
            a=a-b;
            swap(a,b);
            flag=!flag;
        }
        if(flag)printf("Stan wins\n");
        else printf("Ollie wins\n");
    }
    return 0;
}

uva 10368 - Euclid's Game(博弈)

题目链接:uva 10368 - Euclid's Game 题目大意:给出两个数,两个人做一个游戏,每次有stan开始操作,每次操作可以从最大的数中取走若干个小的数,即a-kb,a为比较大的数...
  • u011328934
  • u011328934
  • 2014-07-02 19:56:10
  • 1148

HDU1525 Euclid's Game (找规律博弈)

Euclid's Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To...
  • i1020
  • i1020
  • 2017-04-30 21:44:14
  • 152

Euclid's Game---博弈

#include "iostream" #include "vector" #include "string.h" using namespace std;void swap(int &a, int ...
  • u012319493
  • u012319493
  • 2016-04-04 19:14:03
  • 189

Euclid's Game(poj2348+博弈)

B - Euclid's Game Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Subm...
  • u010579068
  • u010579068
  • 2015-08-05 17:00:07
  • 582

Euclid's Game(0099)

Starts with two unequal positive numbers (M,N and M>N) on the board. Two players move in turn. On ea...
  • hzj96421
  • hzj96421
  • 2015-04-06 16:18:14
  • 418

Euclid's Game - POJ 2348 博弈论

Euclid's Game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 8066   ...
  • u014733623
  • u014733623
  • 2015-05-28 20:04:18
  • 413

POj-2348-Euclid's Game-博弈

Two players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtra...
  • linheyangfan
  • linheyangfan
  • 2011-08-23 21:45:07
  • 372

POJ 2348 Euclid's Game【博弈】

题目链接:http://poj.org/problem?id=2348题意:给定两个数,两个人每次从较大数中减去较小数的倍数,谁先得到0谁获胜,为谁赢?分析:令一种可能出现的整数对为(a,b)(a,b...
  • Yukizzz
  • Yukizzz
  • 2016-03-30 14:13:16
  • 359

求最大公约数的欧几里德算法(Euclid's Algorithm)

 求最大公约数的欧几里德算法(Euclids Algorithm)算法主要基于两条规则:1.If b|a then gcd(a, b) = b.2.If a = bt + r, for integer...
  • jiaolipe
  • jiaolipe
  • 2007-01-07 08:27:00
  • 5112

HD 1525 Euclid's Game

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1525 Problem Description Two players,...
  • eagle_or_snail
  • eagle_or_snail
  • 2016-04-06 22:04:31
  • 250
收藏助手
不良信息举报
您举报文章:hdu1525&poj2348 Euclid's Game
举报原因:
原因补充:

(最多只允许输入30个字)