Slime and Stones

Slime and Stones
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Problem Description

Orac and Slime are playing a game.

There are two groups of stones, the first group contains a stones and the second contains b stones. Orac and Slime operate them by turns in the game. For each operation, they have two choices:

1. Pick up any number of stones from a certain group;

2. Pick up $x$ stones from the first group and $y$ from the second group, which $x,y$ satisfy $|x-y|\le k$. k is a given constant.

Notice that not picking up any stone in an operation is not allowed. If there is no stone left in both groups at the beginning of one’s turn, he loses the game.

Orac would like to know whether there exists a winning strategy for him if he operates first. They will play many times, so he will make multiple queries.

Input

The first line contains one integer $T(1\le T\le 10^5)$, which stands for the number of queries that Orac makes.
In the following $T$ lines, each line contains three integer $a,b,k(1\le a\le 10^8,1\le b\le 10^8,0\le k\le 10^8).$

Output

The output contains $T$ lines, with an integer $0$ or $1$ in each line, stand for there exist/not exist a winning strategy for the given situation.

Sample Input

4
1 2 0
2 4 0
1 2 1
2 6 1

Sample Output

0
1
1
0

Hint

In the first query, if Orac picks up all the stones from a group, Slime will pick up all the stones from the other group, and if Orac picks up a stone from the second group, Slime will pick up a stone from both groups.

思路

易知 $k=0$ 时为威佐夫博弈的一般形式。
当 $k=1$ 时，我们可以利用威佐夫博弈的类似推导方——去寻找必败态。
对于两个石堆 $(a,b)$，不妨设 $a\le b$，稍加打表可以得到
$$\begin{gathered} (1,3) \\ (2,6) \\ (4,10) \\ (5,13) \\ (7,17) \\ (8,20) \end{gathered}$$
…
于是我们可以得到一个规律：
$a[i]=a[i]$和$b[i]$中未出现的最小值,
$b[i]=a[i]+2\ast i$
我们知道威佐夫博弈的通项是$a[i]=[i\ast f](下取整),b[i]=a[i]+i,(f=\frac{1+\sqrt{5}}{2})$
这个和威佐夫博弈的形式很像，所以我们可以用类似的方法推导公式——Betty方程（具体证明过程请自行百度贝蒂定理，这里不再赘述）。
我们列出Betty方程
$$\frac{1}{\alpha }+\frac{1}{\alpha +k+1}=1$$
解得
​$$\alpha =\frac{1-k+\sqrt{k^2+2k+5}}{2}$$
因此我们可以得到
$$a[i]=\lfloor \frac{1-k+\sqrt{k^2+2k+5}}{2}i\rfloor$$
$$b[i]=\lfloor \frac{3+k+\sqrt{k^2+2k+5}}{2}i\rfloor$$
所以验证的时候只需要先计算i即可。
注意到
$$b[i]-a[i]=(k+1)i$$
所以$i=\frac{b[i]-a[i]}{k+1}((b[i]-a[i])必须整除(k+1))$
然后验证下$a[i],b[i]$的值对不对即可(按理来说只需要验证一个，但 $\alpha$ 是个浮点数，会有精度误差)

#pragma GCC optimize(3,"Ofast","inline")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <algorithm>
#include <unordered_map>
#include <vector>
using namespace std;
#define ls (rt<<1)
#define rs (rt<<1|1)
typedef long long ll;
template <typename T>
inline void read(T &x) {
    x = 0;
    static int p;
    p = 1;
    static char c;
    c = getchar();
    while (!isdigit(c)) {
        if (c == '-')p = -1;
        c = getchar();
    }
    while (isdigit(c)) {
        x = (x << 1) + (x << 3) + (c - 48);
        c = getchar();
    }
    x *= p;
}
template <typename T>
inline void print(T x) {
    if (x<0) {
        x = -x;
        putchar('-');
    }
    static int cnt;
    static int a[50];
    cnt = 0;
    do {
        a[++cnt] = x % 10;
        x /= 10;
    } while (x);
    for (int i = cnt; i >= 1; i--)putchar(a[i] + '0');
    puts("");
}
const double pi=acos(-1);
const double eps=1e-6;
const int mod = 1e9+9;
const int inf = 0x3f3f3f3f;
const int maxn = 4e5+10;

ll a,b,k,c;
inline void work() {
    read(a);
    read(b);
    read(k);
    if (a > b) swap(a, b);
    if ((b - a) % (k + 1)) {
        puts("1");
        return;
    }
    double r = (sqrt(k * k + 2 * k + 5.0) - k + 1) / 2.0;
    if (a == (ll) (r * (b - a) / (k + 1)))
        puts("0");
    else
        puts("1");
}
int main() {
    //freopen("1.txt","r",stdin);
    int T = 1;
    read(T);
    while (T--) {
        work();
    }
    return 0;
}