快速幂和快速幂取余和快乘

最新推荐文章于 2024-09-01 09:10:21 发布

MidJuly~

最新推荐文章于 2024-09-01 09:10:21 发布

阅读量101

点赞数

分类专栏：分治和递推

本文链接：https://blog.csdn.net/plutozxc/article/details/109446566

版权

分治和递推专栏收录该内容

1 篇文章 0 订阅

订阅专栏

快速幂
数字太大可以把int换成long long试一试

#include<bits/stdc++.h>
using namespace std;

int PowMod(int a, int b){
  int ans = 1;
  while (b) {
    if (b & 1) 
      ans = (ans*a);
    a = (a*a);
    b >>= 1;
  }
  return ans;
}
int a, b, c;
int main() {
  cin >> a >> b;
  
  cout << a << "^" << b << " = " << PowMod(a, b); 
  return 0;
}

快速幂取余

#include<bits/stdc++.h>
using namespace std;

int PowMod(int a, int b, int c){
  int ans = 1;
  a %= c;
  while (b) {
    if (b & 1) 
      ans = (ans*a)%c;
    a = (a*a)%c;
    b >>= 1;
  }
  return ans;
}
int a, b, c;
int main() {
  cin >> a >> b >> c;
   if (a == c) {//特判相等情况 
      cout<<a<<"^"<<b<<" mod "<<c<<"="<<'0'<<endl;
      return 0;
    }
  cout << a << "^" << b << " mod " << c << "=" << PowMod(a, b, c); 
  return 0;
}

快乘

`#include<bits/stdc++.h>
using namespace std;

int MUL(int a, int b){
  int ans = 0;
  while (b) {
    if (b & 1) 
      ans = (ans+a);
    a = (a*2);
    b >>= 1;
  }
  return ans;
}
int a, b, c;
int main() {
  cin >> a >> b;
  
  cout << a << "^" << b << " = " << MUL(a, b); 
  return 0;
}`