中国剩余定理

设x∈Z，存在

$\{\begin{array}{rl}L& =r_1(modp1)\\ L& =r_2(modp2)\\ L& =r_3(modp3)\end{array}$

令

$\{\begin{array}{rl}P& =p_1{p}_2{p}_3...p_n\\ P_i& =\frac{P}{p_i}\\ t_i& 是P_i关于p_i的逆元，即P_i{t}_i\equiv 1(mod{p}_i)\end{array}$

则

$L={\sum }_{i=1}^n{a}_i{P}_i{t}_i$

扩展欧几里得求L即可

例题：https://vjudge.net/problem/LightOJ-1319

板子：

const int N=12+7;
ll p[N],r[N];
int n;
ll P=1;
ll exgcd(ll a,ll b,ll &x,ll &y)//gcd(a,b)=ax+by;返回值gcd
{
    if(b==0)
    {
        x=1;y=0;
        return a;
    }
    ll g=exgcd(b,a%b,x,y);
    int z=x;
    x=y;
    y=z-y*(a/b);
    return g;
}
void solve()
{
    ll ans=0;
    for(int i=1;i<=n;i++)
    {
        ll pi=P/p[i];
        ll ti,y;
        exgcd(pi,p[i],ti,y);
        ans+=r[i]*pi*ti;
    }
    cout<<(ans%P+P)%P<<endl;
    return ;
}