第六次作业

第1题
$x=8\ast 19\ast 19^{-1}+3\ast 11\ast 11^{-1}$ $mod(11\ast 19)$
(1) 算$19^{-1}$
$19mod11=8$
$8\ast 19^{-1}\equiv 1(mod11)$
$19^{-1}=7$
(2) 算$11^{-1}$
$11\ast 11^{-1}\equiv 1(mod19)$
$11^{-1}=7$
所以：
$x=8\ast 19\ast 7+3\ast 11\ast 7(mod11\ast 19)=41$
第2题
$M=5\ast 7\ast 9\ast 11=3465$
$b_1=M/5=693$
$b_2=M/7=495$
$b_3=M/9=385$
$b_4=M/11=315$
$x=1\ast 693\ast 693^{-1}+2\ast 495\ast 495^{-1}+3\ast 385\ast 385^{-1}+4\ast 315\ast 315^{-1}(mod3465)$
$x=1\ast 693\ast 3+2\ast 495\ast 1+3\ast 385\ast 2+4\ast 315\ast 4(mod3465)=1731$
第3题
$2000^{2019}=40^{2019}\ast 50^{2019}$
$221=13\ast 17$
$40^{2019}(mod221$)=[$1^{2019}$(mod13},$6^{2019}$(mod17}]=[1,$6^3$(mod17)]=[1,12]
$50^{2019}(mod221$)=[$11^{2019}$(mod13},$16^{2019}$(mod17}]=[$11^3$(mod13),$16^3$(mod17)]=[5,16]
$2000^{2019}$(mod211)=[5(mod13),$12\ast 16$(mod)17]=[5,5]=5
第7题

#include<iostream>
using namespace std;
//逆元
int modInverse(int a, int m) {
	int m0 = m, t, q;
	int x0 = 0, x1 = 1;

	if (m == 1)
		return 0;

	while (a > 1) {
		q = a / m;
		t = m;
		m = a % m, a = t;
		t = x0;
		x0 = x1 - q * x0;
		x1 = t;
	}

	if (x1 < 0)
		x1 += m0;

	return x1;
}
//CRT
int CRT(int num, int* m, int* n) {
	int ans = 0;
	//M
	int M = 1;
	for (int i = 0; i < num; i++) {
		M = M * n[i];
	}
	//b[i]
	int b[1000];
	for (int i = 0; i < num; i++) {
		b[i] = M / n[i];
	}
	for (int i = 0; i < num; i++) {
		ans += (modInverse(b[i], n[i])) * b[i] * m[i];
	}
	ans = ans % M;
	return ans;
}

int main() {
	int m[1000], n[1000];
	cout << "请输入方程个数：";
	int num;
	cin >> num;
	cout << "请按x ≡ m (mod n)输入m和n，中间用空格隔开" << endl;
	for (int i = 0; i < num; i++) {
		cin >> m[i] >> n[i];
	}
	
	cout << "答案是" << CRT(num, m, n);
	return 0;

}