CINTA作业三

1.实现求乘法逆元的函数,给定a和m,求a模m的乘法逆元,无解时请给出无解提示,并且只返回正整数。进而给出求解同余方程(ax = b mod m)的函数,即给定a,b,m,输出满足方程的x,无解给出无解提示

#include<iostream>
using namespace std;

int egcd(int a, int b, int &r, int &s) {
	r = 1, s = 0;
	int r1 = 0, s1 = 1, q;
	int temp;
	while (b) {
		q = a / b;
		r = r - q * r1;
		s = s - q * s1;
		temp = a;
		a = b;
		b = temp % b;
		swap(r, r1);
		swap(s, s1);
	}
	return a;
}
int func(int a, int m) {
	int x = 0, y = 0;
	int val = egcd(a, m, x, y);
	return val = 1 ? x : 0;
}

int main() {
	int a, m;
	cin >> a >> m;
	if (func(a, m)) { cout << "乘法逆元是:" << func(a, m) << endl; }
	else cout << "无解" << endl;
	return 0;
}

2.实现模指数运算的函数,给定x、y和m,求x的y次方模m

int func(int x, int y, int p) {
	int val = 0;
	while (y > 0)
	{
		if ((y & 1) == 1) { val = (val * x) % p; }
		y = y / 2;
		x = x * x % p;

	}
	return val;
}

3.设p = 23和a = 5,使用费尔马小定理计算a^{2020} mod p

5 2020 m o d 23 = 5 ( 23 − 1 ) ∗ 91 + 18 m o d 23 = 5 18 m o d 23 = 6 5^{2020} mod 23 = 5^{(23−1)∗91+18} mod 23 = 5^{18} mod 23 =6 52020mod23=5(231)91+18mod23=518mod23=6


4.使用欧拉定理计算2^{100000} mod 55

由题: Φ ( 55 ) = 40 Φ(55) = 40 Φ(55)=40
2 Φ ( n ) ≡ 1 m o d ( 55 ) 2^{Φ(n)} ≡ 1 mod (55) 2Φ(n)1mod(55)
2 100000 m o d 55 = 2 40 ∗ 2500 m o d 55 = 1 2^{100000} mod 55 = 2^{40 * 2500} mod55 = 1 2100000mod55=2402500mod55=1


5.手动计算7^{1000}的最后两个数位等于什么

计算 7 1000 7^{1000} 71000 最后两位数就是求 7 1000 m o d 100 7^{1000} mod 100 71000mod100

Φ ( 100 ) = 40 Φ(100) = 40 Φ(100)=40

所以 7 40 ≡ 1 m o d ( 100 ) 7^{40} ≡ 1 mod (100) 7401mod(100)

计算后可知答案为1

综上所述:最后两位数位数位等于:01

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
好的,这里是50种不同国家的语言表达“我爱你”: 1. English - I love you 2. Spanish - Te quiero 3. French - Je t'aime 4. German - Ich liebe Dich 5. Italian - Ti amo 6. Portuguese - Eu te amo 7. Russian - Ya lyublyu tebya 8. Chinese (Mandarin) - Wo ai ni 9. Japanese - Aishiteru 10. Korean - Sarang hae 11. Arabic - Ana behibak (to a male) / Ana behibek (to a female) 12. Dutch - Ik hou van je 13. Danish - Jeg elsker dig 14. Swedish - Jag älskar dig 15. Norwegian - Jeg elsker deg 16. Finnish - Minä rakastan sinua 17. Polish - Kocham Cię 18. Czech - Miluji Tě 19. Hungarian - Szeretlek 20. Bulgarian - Obicham te 21. Greek - S'ayapo 22. Turkish - Seni seviyorum 23. Romanian - Te iubesc 24. Croatian - Volim te 25. Serbian - Volim te 26. Slovenian - Ljubim te 27. Slovak - Milujem Ťa 28. Estonian - Ma armastan sind 29. Latvian - Es tevi mīlu 30. Lithuanian - Aš tave myliu 31. Icelandic - Ég elska þig 32. Albanian - Te dua 33. Thai - Phom rak khun (to a male) / Chan rak khun (to a female) 34. Vietnamese - Anh ye^u em (to a female) / Em ye^u anh (to a male) 35. Indonesian - Saya cinta padamu 36. Filipino - Mahal kita 37. Hindi - Main tumse pyar karta hoon 38. Bengali - Ami tomake bhalobashi 39. Urdu - Main tumse muhabbat karta hoon 40. Marathi - Me tujhe pyaar kartaa hoo 41. Punjabi - Main tere pyar da haan 42. Telugu - Nenu ninnu premisthunnanu 43. Tamil - Naan unnai kaadhalikken 44. Malayalam - Njan ninnodenikkoo 45. Kannada - Naanu ninna preetisuttene 46. Gujrati - Hu tane pyar karoo chu 47. Nepali - Ma timilai maya garchu 48. Sinhala - Mama oyata arderyi 49. Burmese - Chit pa de 50. Mongolian - Bi chamd hairtai

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值