hdu 1527

[code]#include <iostream>
#include <cmath>
#include <cstdio>       
using namespace std;
const double q = (1 + sqrt(5.0)) / 2.0;   // 黄金分割数
int Wythoff(int a, int b)
{
    if (a > b)
       swap(a, b);
    int k = b - a;
    if (a == (int)(k * q))
       return 0;               // 奇异局面， 先手必败
    return 1;
}
int main ()
{
    int a, b;
    while (scanf("%d%d", &a, &b) != EOF)
    {
       printf("%d\n", Wythoff(a, b));
    }
}