威佐夫博弈 入门级
奇异局势判定
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 7, INF = 0x7f7f7f7f, mod = 1e9 + 7;
int a, b;
int main() {
while(~scanf("%d %d", &a, &b)) {
if(a > b) swap(a, b);
int k = b - a;
int a_ = k * (sqrt(5.0) + 1) / 2;
if(a_ == a) puts("0");
else puts("1");
}
return 0;
}