1.
include<math.h>
void qumo(int x,int y,int n)
{
cout << "请输入底数的值:";
cin >> x;
cout << "请输入指数的值:";
cin >> y;
cout << "请输入取模的值:";
cin >> n;
int s = pow(x,y);
int m = s % n;
cout << x << "的" << y << "次方取余" << n << "的值为:" << m << endl;
}
2.这个斐波那契数列我不会用快速指数模运算,我用自己的写的方法计算出的斐波那契数列
void Fibonacci(){
int N;
cout<<"请输入N的值:";
cin>>N;
int a[N];
a[0] = 0;
a[1] = 1;
for(int i = 2;i<N;i++)
{
a[i] = a[i-2] + a[i-1];
}
for(int j = 0;j<N;j++){
cout<<a[j]<<" ";
}
return 0;
}
输入互素的正整数 c 和 m,返回 c ,使得 cc−1 ≡ (mod m)。要求:只返回为正整数的 c−1
int egcd(int a, int b, int &x, int &y)
{
if (b == 0) {
x = 1, y = 0;
return a;
}
int r = egcd(b, a % b, y, x);//ax + by = 1
y -= (a / b) * x;
return r;
}