洛谷 P4777 【模板】扩展中国剩余定理（EXCRT）

https://www.luogu.com.cn/problem/P4777

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn=1e5+5;

int n;
ll a[maxn],m[maxn];

ll qmul(ll a,ll b,ll p)
{
    ll ans=0;
    while(b)
    {
        if(b&1)
            ans=(ans+a)%p;
        a<<=1;
        a%=p;
        b>>=1;
    }
    return ans;
}

ll fmul(ll a,ll b,ll p)
{
    return (a*b-(ll)((long double)a*b/p)*p+p)%p;
}

ll exgcd(ll a,ll b,ll &x,ll &y)
{
    if(b==0)
    {
        x=1,y=0;
        return a;
    }
    ll c=exgcd(b,a%b,x,y);
    ll t=x;
    x=y;
    y=t-a/b*y;
    return c;
}

ll EXRCT()
{
    ll ans=a[1],M=m[1];
    ll x,y,gcd;
    for(int i=2;i<=n;i++)
    {
        gcd=exgcd(M,m[i],x,y); // M * x + m[i] * y = gcd(M,m[i])
        ll t1=((a[i]-ans)%m[i]+m[i])%m[i];
        ll t2=m[i]/gcd;
        if(t1%gcd!=0)
            return -1; //无解
        x=fmul(x,t1/gcd,t2);
        ans+=x*M;
        M*=t2;
        ans=(ans%M+M)%M;
    }
    return ans;

}

int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%lld %lld",&m[i],&a[i]);
    printf("%lld\n",EXRCT());
    return 0;
}