hihocoder 1303 数论六·模线性方程组 扩展中国剩余定理

https://vjudge.net/problem/HihoCoder-1303

思路：模板题。

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

const int maxn=1005;

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

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 EXCRT()
{
    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);
        ll t1=((a[i]-ans)%m[i]+m[i])%m[i];
        ll t2=m[i]/gcd;
        if(t1%gcd)
            return -1;
        x=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",EXCRT());
    return 0;
}