这里说的很详细:http://blog.csdn.net/y990041769/article/details/21694007
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<string>
#include<cstring>
#include<cstdio>
#include<cmath>
typedef long long LL;
using namespace std;
LL a,b,c; //c为差值
int main()
{
// freopen("E:\\ACM\\test.txt","r",stdin);
double d=(sqrt(5)+1)/2.0; //威佐夫博弈1.618
// printf("%.10f\n",d);
while(cin>>a>>b)
{
if(a<b) swap(a,b);
c=(a-b)*d;
if(c==min(a,b)) puts("0");
else puts("1");
}
return 0;
}