[数论]中国剩余定理

模数要两两互质，否则请使用EXCRT
https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1079

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

void extgcd(ll a, ll b, ll &g, ll &x, ll &y)
{
    if (b == 0) g = a, x = 1, y = 0;
    else{
        extgcd(b, a % b, g, y, x);
        y -= (a / b) * x;
    }
}

int main()
{
    ll n, a[15], m[15];
    cin >> n;
    ll M = 1;
    for (int i = 0; i < n; ++i){
        cin >> m[i] >> a[i];
        M *= m[i];
    }
    ll ans = 0;
    for (int i = 0; i < n; ++i){
        ll x, y, g;
        extgcd(M / m[i], m[i], g, x, y);
        ans = (ans + a[i] * ((x + m[i] / g) % (m[i] / g)) * (M / m[i])) % M;
    }
    cout << ans << endl;
    return 0;
}

扩展中国剩余定理(EXCRT)：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
void extgcd(ll a, ll b, ll &g, ll &x, ll &y)
{
    if (b == 0) g = a, x = 1, y = 0;
    else{
        extgcd(b, a % b, g, y, x);
        y -= (a / b) * x;
    }
}
ll ma[maxn], mb[maxn], mm[maxn];
int main()
{
    ios::sync_with_stdio(0); cin.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> ma[i] >> mb[i];
    //x = k1a1 + b1 = k2a2 + b2
    //k1a1 - k2a2 = b2 - b1
    ll fb = mb[1], fa = ma[1], g, x, y, t, mi;
    for (int i = 2; i <= n; ++i){
        extgcd(fa, -ma[i], g, x, y);
        t = (mb[i] - fb) / g;
        //x ≡ b1 (mod a1)
        //x ≡ k1a1 + b1 ≡ k2a2 + b2 (mod lcm(a1, a2))
        mi = ma[i] / abs(g);
        x = (x % mi + mi) % mi;
        x = (x * t % mi + mi) % mi;
        fb += x * fa;
        fa = fa / abs(g) * ma[i];
        fb %= fa;
    }
    cout << fb << endl;
    return 0;
}