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
题意:给定两个数,大的数减去小的数的倍数,两个数中先减出零的获胜。注意stan先手。
思路:根据题意我们可以得到,先得到m%n==0的获胜,还有就是当m/n>=2时stan获胜(stan先手),具体需要自己分析。
AC代码:(Java)
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in =new Scanner(System.in);
int n,m,k;
while(in.hasNext())
{
n=in.nextInt();
m=in.nextInt();
if(n==0 && m==0) break;
int sum=0;
if(n>m)
{
int t=n;
n=m;
m=t;
}
while(true)
{
if(m/n>=2 || m%n==0)
break;
k=m;
m=n;
n=k-n;
sum++;
}
if(sum%2==0)
System.out.println("Stan wins");
else
System.out.println("Ollie wins");
}
}
}
AC代码:(C++)
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m,k;
while(~scanf("%d%d",&n,&m),n,m)
{
int flag=0;
if(m < n) swap(m,n);
while(1)
{
if(m/n>=2 || m%n==0)
break;
k=m;
m=n;
n=k-n;
flag++;
}
if(flag%2==0)
printf("Stan wins\n");
else
printf("Ollie wins\n");
}
return 0;
}