文章目录
1、实现求乘法逆元的函数,给定a和m,求a模m的乘法逆元,无解时请给出无解提示,并且只返回正整数。进而给出求解同余方程(ax = b mod m)的函数,即给定a,b,m,输出满足方程的x,无解给出无解提示。
代码如下:
#include<iostream>
using namespace std;
int gcd(int a, int b);
int egcd(int a, int b);
int SolveEquations(int a, int b, int m);
int main()
{
int a, b, m;
cout << "请分别输入整数a和m" << '\n';
cin >> a >> m;
if (egcd(a, m) == 0) {
cout << "不存在a模m的乘法逆元!" << endl;
}
else
cout << "a模m的乘法逆元为:" << egcd(a, m) << endl;
cout << '\n' << '\n' << "输入同余方程(ax = b mod m)的相关数据a,b,m(m>0)" << endl;
cin >> a >> b >> m;
if (SolveEquations(a, b, m) == -1) {
cout << "该同余方程无解!" << endl;
}
else
cout << "该同余方程的解为: x=" << SolveEquations(a, b, m) << endl;
}
int gcd(int a, int b)
{
int t;
while (b != 0)
{
t = a % b;
a = b;
b = t;
}
return a;
}
int egcd(int a, int b)
{
int m = b;
if (gcd(a, b) != 1)
return 0;
else
{
int r0 = 1, r1 = 0, s0 = 0, s1 = 1;
while (b)
{
int q = a / b;
int t = b;
b = a % b;
a = t;
int x = r1;
r1 = r0 - q * r1;
r0 = x;
int y = s1;
s1 = s0 - q * s1;
s0 = y;
}
if (r0 > 0)
return r0;
else
return r0 + m;
}
}
int SolveEquations(int a, int b, int m)
{
if (b % gcd(a, m) != 0)
return -1;
else
{
int x = 1;
b = egcd(a, m) * b;
while ((x - b) % m != 0)
x++;
return x;
}
}
2、实现模指数运算的函数,给定x、y和m,求x的y次方模m。
代码如下:
int ModExp(int x, int y, int m)
{
int r = 1;
while (y > 0)
{
if ((y & 1) == 1) r = (r * x) % m;
y = y / 2;
x = (x * x) % m;
}
return r;
}