中国剩余定理 不互质

然，对于不互质的情况，同样可以用它来解。将方程组合并。推导如下
取两方程组
{x = n1*k1 + a1 ;
{x = n2*k2 + a2 ;
目标合成为x = n*k + a;
有n1*k1+a1 = n2*k2 + a2 ;
设d = gcd(n1,n2) ;
则有（n1*k1)/d - (n2*k2)/d = (a2-a1)/d; I
a：当且仅当 d|(a2-a1) ，有整数解。
b: ->（n1*k1)/d = (a2-a1)/d + n2/d*k2 ;
-> (n1*k1)/d = (a2-a1)/d (mod n2/d) ;
<->k1 = (a2-a1)/d*(n1/d)^(-1) (mod n2/d);
设 K = (a2 - a1)/d*(n1/d)^(-1) ;
k1 = K+(n2/d)*y ; II
带入方程组1式。有：
x = n1*[(n2/d)*y + K] + a1;
<-> x = (n1*n2)/d*y + (n1*K+a1) ;
-> x = n1*K+a1( mod (n1*n2)/d );
ok -> 解得
a = n1*K+a1 ;
n = (n1*n2)/d 。
同理，依次合并所有等式。
得 x = a(mod n) .
POJ 1891
HDU 3579

#include<algorithm>
#include<iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include <fstream>
using namespace std;
typedef long long ll ;
ll a[500] , m[500] ;
ll gcd(ll a , ll b){
    return b == 0 ? a : gcd(b,a%b) ;
}
ll exgcd(ll a , ll b , ll&x , ll &y){
    if(b==0){
        x = 1 , y = 0 ;
        return a ;
    }
    else {
        ll r = exgcd(b,a%b,x,y) ;
        ll t = x ;
        x = y ;
        y = t - a/b*y ;
        return r ;
    }
}
ll inv(ll a , ll m){        // qiu niyuan
    ll x, y ;
    ll r = exgcd(a,m,x,y) ;
    if(r!=1) return 0 ;
    return (x%m+m)%m ;
}
bool Merge(ll a1 , ll a2 , ll m1 , ll m2 , ll &a3 , ll&m3){
    ll c = a2 - a1 ;
    ll d = gcd(m1,m2) ;
    if(c%d) return false ;
    ll n1 = m1/d ;
    ll n2 = m2/d ;
    c = c/d ;
    c = c*(inv(n1,n2)) ;
    c %= n2 ;
    c = c*m1 + a1 ;
    m3 = n1*m2 ;
    a3 = (c%m3+m3)%m3 ;
    return true ;
}
ll CRT2(ll a[] , ll m[] , ll n) {
    ll a1 = a[0] , m1 = m[0] ;
    ll aa = a[0] , mm ; // 
    for(int i = 1 ; i < n ; i++){
        bool flag = Merge(a1,a[i],m1,m[i],aa,mm) ;
        if(flag==0) return -1 ;
        a1 = aa , m1 = mm ;
    }
    return (aa%mm+mm)%mm ;
}
int main(){
   int t , n;
   cin >> t ;
   int cas = 1 ;
   while(t--){
     cin >> n ;
     for(int i = 0 ; i < n ; ++i){
        cin >> m[i] ;
     }
     int z = 0;
     for(int i = 0; i < n ;++i){
        cin >> a[i] ;
        if(!a[i]) z++;
     }
     ll ans ;
     if(z == n){
        ll tmp = m[0] ;
        for(int i = 1 ; i < n; ++i){
            tmp = m[i]/gcd(m[i],tmp)*tmp ;
        }
        ans = tmp ;
     }
     else
        ans = CRT2(a,m,n) ;
     printf("Case %d: %lld\n",cas++,ans) ;
    }
    return 0 ;
}