扩展中国剩余定理模版

#include <cstdio>
using namespace std;
typedef long long ll;

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

ll n,ans,lcm,m,a,s,t;

void excrt(){
    int flag=0;
    scanf("%lld%lld",&lcm,&ans);
    while(--n){
        scanf("%lld%lld",&m,&a);//x=a%m
        ll c=((a-ans)%m+m)%m;
        ll d=exgcd(lcm,m,s,t);
        if(c%d)flag=1;
        s=c/d*s%(m/d);// trap: overflow 
        ans+=s*lcm,lcm=m/d*lcm,ans=(ans%lcm+lcm)%lcm;
    }
    if(flag)puts("-1");
    else printf("%lld\n",ans);
}

int main(){
    while(scanf("%lld",&n)!=EOF)excrt();
    return 0;
}