线性同余方程

int Extend_Gcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1, y = 0;
        return a;
    }
    int d = Extend_Gcd(b, a % b, x, y);
    int z = x;
    x = y;
    y = z - y * (a / b);
    return d;
}

int Linear_Congruence_Equation(int a, int b, int m) {//a * x 与 b 同余 m
    int x, y;
    int d = Extend_Gcd(a, m, x, y);
    return (((x * (b / d)) % m) + m) % m;
}