题目链接:https://www.luogu.com.cn/problem/P1226
模板题,快速幂模板
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
ll a, b, p;
int main(){
cin >> a >> b >> p;
int res = 1 % p;//当p为1时,res为0,注意特殊情况
ll aa = a, bb = b;
while (b){
if (b & 1) res = (res * a) % p;
b >>= 1;
a = a * a % p;
}
printf("%lld^%lld mod %lld=%lld\n", aa, bb, p, res);
return 0;
}