威佐夫博弈
#include <iostream> #include <cstdio> #include <iomanip> #include <string> #include <cstdlib> #include <cstring> #include <queue> #include <set> #include <vector> #include <map> #include <algorithm> #include <cmath> #include <stack> #include <stdlib.h> #include <stdio.h> #define INF 0x3f3f3f3f #define LINF 0x3f3f3f3f3f3f3f3f #define ll long long #define ull unsigned long long #define uint unsigned int #define l(x) x<<1 #define r(x) x<<1|1 #define ms(a,b) memset(a,b,sizeof(a)) using namespace std; int main() { int n, m; int temp; while (cin >> n >> m) { temp = (int)(((sqrt(5) + 1) / 2)*((double)(abs(n - m)))); if (temp == min(n, m)) printf("0\n"); else printf("1\n"); } }