中国剩余定理模版【中国剩余定理】

/*
    问题：求解 n个方程：x=a[i](mod m[i]) (0<=i
#include
#include
using namespace std;
typedef long long LL;
const int maxn = 105;
void ex_gcd(LL a, LL b, LL &x, LL &y, LL &d){
    if (!b) {d = a, x = 1, y = 0;}
    else{
        ex_gcd(b, a % b, y, x, d);
        y -= x * (a / b);
    }
}
LL inv(LL t, LL p){//如果不存在，返回-1
    LL d, x, y;
    ex_gcd(t, p, x, y, d);
    return d == 1 ? (x % p + p) % p : -1;
}

//n个方程：x=a[i](mod m[i]) (0<=i>n;
    for(int i=0;i>m[i]>>a[i];
    }
    cout<