经典的博弈题!!! 不懂的可以上网查看“威佐夫博弈”。 #include <iostream> #include <cmath> using namespace std; int main() { int n, m; while(scanf("%d %d", &n, &m) != EOF) { if(n == 0 && m == 0) { cout << 0 << endl; continue; } double a = (1 + sqrt(5.0)) / 2; if(n == m) { cout << 1 << endl; continue; } else { if(n > m) swap(n, m); if((int)((m-n)*a) != n) cout << 1 << endl; else cout << 0 << endl; } } return 0; }