Euclid's Game
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 9481 | Accepted: 3884 |
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):
an Stan wins.
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
博弈+GCD变式思路如下:
首先分类讨论。
设两数分别为n,m,
当max(n,m)/min(n,m)>=2的时候
此时该方一定属于必胜态(因为可以让对方强制进入也可以使自己进入下一阶段)
然后当max(n,m)/min(n,m)==1时,这时候就可以用GCD改版计数+判断。
#include <iostream>
#include <stdio.h>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b,ll ans){
if(!b)
return ans;
if(max(a,b)/min(a,b)>=2)
return ans^1;
return gcd(b,a%b,ans^1);
}
int main(){
ll n,m;
while(~scanf("%I64d%I64d",&n,&m)&&n&&m){
puts(gcd(max(n,m),min(n,m),1)==0?"Stan wins":"Ollie wins");
}
return 0;
}