2019徐州网络赛 A.who is better?

题意

有一堆数量为N的石子，两个人轮流取，规定：

1. 第一个人不能直接取完石子
2. 每人每次可以取m个石子，满足 $1\le m\le 2\ast p$， p表示上一个人取的石子数
3. 轮到某人无石子可取时，判负

另，N由K个线性同余方程组给出

分析

解线性同余方程组+斐波那契博弈模板题。

代码

#include<bits/stdc++.h>
using namespace std;

typedef long long LL;

const LL maxn = 1e15;

map<LL, bool> fib;

LL gcd(LL a, LL b)
{
    return b == 0 ? a : gcd(b, a%b);
}
LL extgcd(LL a, LL b, LL &x, LL & y) {
    LL d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}
LL mod_inverse(LL a, LL m) {
    LL x, y;
    extgcd(a, m, x, y);
    return (m + x % m) % m;
}
int main()
{
    int k;
    LL u = 1, v = 1;
    while (v <= maxn) {
        fib[v] = true;
        LL temp = v;
        v = u + v;
        u = temp;
    }
    cin >> k;
    LL x = 0, m = 1;
    for (int i = 0; i < k; i++) {
        LL B, M;
        cin >> M >> B;
        LL a = m, b = B - x, d = gcd(M, a);
      //  cout << a << ' ' << b << ' ' << d  << endl;
        if (b % d != 0) {
            puts("Tankernb!");
            return 0;
        }
        LL t = b / d * mod_inverse(a / d, M / d) % (M / d);
        x = x + m * t;
        m *= M / d;
    }
    x = (x + m) % m;
    if (fib.count(x)) {
        puts("Lbnb!");
    } 
    else puts("Zgxnb!");
    
}