别看了,我没学会
暂时先搞一个板子过来嘿嘿嘿
int CRT(int a[], int m[], int n) {
int M = 1;
int ans = 0;
for(int i = 1; i <= n; i++) M *= m[i];
for(int i = 1; i <= n; i++) {
int x, y;
int Mi = M / m[i];
extend_Euclid(Mi, m[i], x, y);
ans = (ans + Mi * x * a[i]) % M;
}
if(ans < 0) ans += M;
return ans;
}
//原文:https://blog.csdn.net/acdreamers/article/details/8050018
扩展版本
ll exgcd(ll a, ll b, ll &x, ll &y) {
if(b == 0) {x = 1; y = 0; return a;}
ll gcd = exgcd(b, a % b, x, y), tp = x;
x = y; y = tp - a / b * y;
return gcd;
}
ll excrt() {
ll x,y,k; ll M = bi[1],ans = ai[1];
for(int i = 2; i <= n; i++) {
ll a = M,b = bi[i],c = (ai[i] - ans % b + b) % b;
ll gcd = exgcd(a, b, x, y), bg = b / gcd;
if(c % gcd != 0) return -1;
x = mul(x, c / gcd, bg);
ans += x * M; M *= bg;
ans = (ans % M + M) % M;
}
return (ans % M + M) % M;
}
//原文:https://blog.csdn.net/niiick/article/details/80229217