hdoj problem 1525 Euclid's Game （博弈问题（寻找关键点））

Euclid's Game

http://acm.hdu.edu.cn/showproblem.php?pid=1525

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

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

 

Recommend

LL   |   We have carefully selected several similar problems for you:  1536 1524 1404 1729 1730 

/*

题意：给你两个数，每次可以拿大的那个数减去小的那个数的正整数倍，只要减去后得到的数是正的或者0就行，谁先得到其中一个数是0，谁就胜出。

*/

/*

两个数a和b，总会出现的一个局面是b,a%b，这是必然的，如果a>=b&&a<2*b，那么只有一种情况，直接到b,a%b。否则有多种情况。
对于对于a/b==1这种局面，只可能到b,a%b，没有选择。而a/b>=2的话，先手可以选择由谁面对b,a%b这样的局势
显然选手足够聪明b,a%b谁必胜必败已经清楚，先手在a/b>=2的局面必胜

假设a>b,如果a/b>=2,那么后面就会出现a/b种路线，当a/b=1的时候只有一种路线，所以谁到了a/b>=2这个局面就有必胜策略，此外，当a%b==0的时候，就直接跳出来了，也是必胜点。

*/

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)&&(n||m))
{
int flag=1;
while(1)
{
if(n<m)
 swap(n,m);
 if(n==0||m==0||n%m==0||n/m>=2)
 break;
 n%=m;
 flag=!flag;
}
if(flag)
 printf("Stan wins\n");
 else
   printf("Ollie wins\n");
}
return 0;
}