( 数论专题 )【中国剩余定理】
中国剩余定理的具体描述是这样的:
给出你n个ai和mi,最后让求出x的最小值是多少。
n个m两两互质:
///n个mi互质
const LL maxn = 20;
LL a[maxn], m[maxn], n;
LL CRT(LL a[], LL m[], LL n)
{
LL M = 1;
for (int i = 0; i < n; i++) M *= m[i];
LL ret = 0;
for (int i = 0; i < n; i++)
{
LL x, y;
LL tm = M / m[i];
ex_gcd(tm, m[i], x, y);
ret = (ret + tm * x * a[i]) % M;
}
return (ret + M) % M;
}
n个m不两两互质:
///n个mi不互质
const LL maxn = 1000;
LL a[maxn], m[maxn], n;
LL CRT(LL a[], LL m[], LL n) {
if (n == 1) {
if (m[0] > a[0]) return a[0];
else return -1;
}
LL x, y, d;
for (int i = 1; i < n; i++) {
if (m[i] <= a[i]) return -1;
d = ex_gcd(m[0], m[i], x, y);
if ((a[i] - a[0]) % d != 0) return -1; //不能整除则无解
LL t = m[i] / d;
x = ((a[i] - a[0]) / d * x % t + t) % t; //第0个与第i个模线性方程的特解
a[0] = x * m[0] + a[0];
m[0] = m[0] * m[i] / d;
a[0] = (a[0] % m[0] + m[0]) % m[0];
}
return a[0];
}