2020 杭电多校 Slime and Stones（ex威佐夫博弈）

题目链接

思路

代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    ll t, n, m, k;
    scanf("%d", &t);
    while(t--){
        scanf("%lld %lld %lld", &n, &m, &k);
        k++;
        if(n > m)   swap(n, m);
        ll x = (m - n) / k;
        ll ans1 = x * ((2 - k + sqrt(4 + k * k)) / 2);
        ll ans2 = x * ((2 + k + sqrt(4 + k * k)) / 2);
        if(ans1 == n && ans2 == m)
            printf("0\n");
        else
            printf("1\n");
    }
	return 0;
}