【数论】【中国剩余定理】解线性模方程

n个方程：x=a[i](mod m[i]) (0<=i

ll china(int n,int *a,int *m){
    ll M=1,d,y,x=0;
    for(int i=0;i<n;i++) M*=m[i];
    for(int i=0;i<n;i++){
        ll w=M/m[i];
        gcd(m[i],w,d,d,y);
        x=(x+y*w*a[i])%M;
    }
    return (x+M)%M;
}