poj2348 Euclid's Game

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.

对于状态(x,y)，不妨设x>y。那么(x,x+y)只有唯一的取法，也就是取成(x,y)。因此，(x,y)和(x,x+y)的胜负情况必然相反。
这样的话，如果x/y=1，那么先手只有唯一一种取法，递归即可。否则，设x%y=k，那么一定可以先手到达(k,y)和(k+y,y)。因为这两种胜负情况相反，先手一定可以找到一个取胜的策略。

#include<cstdio>
#include<algorithm>
using namespace std;
bool win(int x,int y)
{
    if (x<y) swap(x,y);
    if (x%y==0) return 1;
    if (x/y>=2) return 1;
    return !win(y,x-y);
}
int main()
{
    int x,y;
    while (scanf("%d%d",&x,&y)&&x)
      if (win(x,y)) printf("Stan wins\n");
      else printf("Ollie wins\n");
}