中国剩余定理

https://vj.xtuacm.cf/contest/view.action?cid=57#problem/B
这题目除数互质，裸的模板

#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <cstring>#include <vector>#include <set>#define ll long longusing namespace std;const int maxn=1020;ll a[maxn],b[maxn];void e_gcd(ll  a,ll b,ll &x,ll &y){    if(b==0)    {        x=1;        y=0;        return ;    }    e_gcd(b,a%b,x,y);    ll temp=x;    x=y;    y=temp-a/b*y;    //return ans;}ll CRT(ll a[],ll b[],ll n){    ll M=1;    ll ans=0;    for(int i=0;i<n;i++)        M*=a[i];    for(int i=0;i<n;i++)    {        ll x,y;        ll mi=M/a[i];        e_gcd(mi,a[i],x,y);        ans=(ans+mi*x*b[i])%M;    }    if(ans<0)        ans+=M;    return ans;}int main(){    int n;    while(~scanf("%d",&n))    {        for(int i=0;i<n;i++)            scanf("%I64d%I64d",&a[i],&b[i]);        ll ans=CRT(a,b,n);        cout<<ans<<endl;    }    return 0;}