威佐夫博弈——取石子游戏 POJ - 1067

题解：威佐夫博弈的板子题

#include<iostream>
#include<cstdio>
#include<map>
#include<algorithm>
#include<cmath>
#define LL long long
using namespace std;
int main()
{
    int a,b;
    double l = (sqrt((double)5)+1)/double(2); 
    while(~scanf("%d%d",&a,&b))
    {
        int c = abs(a-b);
        a = a>b?b:a;
        if(a==(int)(l*c)) printf("0\n");
        else printf("1\n");
    }
    return 0;
}