中国剩余定理
模数互质
定理:若m1,m2,…,mn是两两互质的正整数,则对于任意的n个整数a1,a2,…,an,同余方程组x≡ai(mod mi)(i=1,2,3,…,n)有整数解,并且在模M下解唯一。构造方程组的解为:x = a1 M 1 M_1 M1 x 1 x_1 x1+ a 2 M 2 x 2 a_2M_2x_2 a2M2x2+…+ a n M n x n a_nM_nx_n anMnxn,其中:M = ∏ m i , M i = M / m i \prod{m_i},M_i=M/m_i ∏mi,Mi=M/mi, x i x_i xi是线性同余方程, M i x i M_ix_i Mixi ≡ 1(mod m i m_i mi)的一个解(因为 M i 和 m i M_i和m_i Mi和mi)互质,必有解)。
int ex_gcd(int a,int b,int &x,int &y){
if(b==0) { x=1,y=0; return a}
int d = ex_gcd(b,a%b,x,y);
int temp = x;
x = y;
y = temp - a/b*y;
return d;
}
int chinese_remain(int n){
int M=1,x,y,ans=0;
for(int i=0;i<n;i++) M*=mi[i];
for(int i=0;i<n;i++){
int MI = M/mi[i];
ex_gcd(MI,mi[i],x,y);
ans = (ans+MI*x*ai[i])%M;
}
return (ans%M+M)%M;
}
模数不互质
{ x = a 1 ( m o d n 1 ) x = a 2 ( m o d n 2 ) → { x = k 1 n 1 + a 1 x = k 2 n 2 + a 2 → k 1 n 1 = ( a 2 − a 1 ) ( m o d n 2 ) \begin{cases} x = a_1(mod\ n_1) \\ x = a_2(mod\ n_2) \end{cases} \to\begin{cases} x = k_1n_1 + a_1 \\ x = k_2n_2 + a_2 \end{cases} \to k_1n_1 = (a_2-a_1)(mod\ n2) {x=a1(mod n1)x=a2(mod n2)→{x=k1n1+a1x=k2n2+a2→k1n1=(a2−a1)(mod n2)
根据线性同余方程相关定理可得:当且仅当 g c d ( n 1 , n 2 ) ∣ a 2 − a 1 gcd(n_1,n_2)|a2-a1 gcd(n1,n2)∣a2−a1,方程有解。
令 d = g c d ( n 1 , n 2 ) gcd(n1,n2) gcd(n1,n2) c = a 2 − a 1 a_2\ - a_1 a2 −a1
k 1 n 1 = ( a 2 − a 1 ) ( m o d n 2 ) → k 1 n 1 d = a 2 − a 1 d ( m o d n 2 d ) → k 1 = ( a 2 − a 1 ) d ∗ i n v ( n 1 d ) ( m o d n 2 d ) k_1n_1=(a_2-a_1)(mod\ n_2) \to \frac{k_1n_1}{d} = \frac{a_2-a_1}{d}(mod\ \frac{n_2}{d})\to k_1 =\frac{(a2-a1)}{d}*inv(\frac{n_1}{d})(mod\ \frac{n_2}{d}) k1n1=(a2−a1)(mod n2)→dk1n1=da2−a1(mod dn2)→k1=d(a2−a1)∗inv(dn1)(mod dn2)
int chinese_remain(int n){
int a1=ai[0],k1=mi[0],x,y,ans=0;
for(int i=1;i<n;i++){
int d = ex_gcd(k1,mi[i],x,y);
int c = ai[i]-a1;
if(c%d){// 当且仅当gcd(n1,n2)|a2-a1,方程有解
return -1;
}
int temp = c/d*x%(mi[i]/d); // 由费小马定理可得求出的x为n1/d的逆元
ans += k1*temp;
k1 = (k1*mi[i])/d;
ans %= k1;
}
return (ans%k1+k1)%k1;
}