HDU 1525 Euclid's Game (博弈)

#include <iostream>
#include <algorithm>
using namespace std;



int main()
{
	int m,n,win;
	while (cin>>m>>n,m&&n)
	{
		win = 0;
		if(m<n)
			swap(m,n);
		while (n)
		{
			if (m==n || m/n >= 2)
		         break;
			m = m-n;
            swap(m,n);
			win ^= 1;
		}
		if (win)
		{
			cout<<"Ollie wins"<<endl;
		}
		else
            cout<<"Stan wins"<<endl;
	}
    return 0;
}

题意：

输入两个数m,n，stan首先从最大的数中取出两个数中的小的数的任意倍数的数，

分类讨论：首先，当m=n时，stan赢

                                当0<n<2m时，只有一条路，n=n-m，再对m，n分析，直到n=0；

                                当n>=2m时，stan赢

Euclid's Game

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2267    Accepted Submission(s): 1023

Problem 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

University of Waterloo Local Contest 2002.09.28