题目链接
AcWing89.
代码
#include <iostream>
using namespace std;
typedef long long ll;
ll quick_mod(ll a,ll b,ll MOD){
ll res = 1;
while(b){
if(b&1) res = res * a % MOD;
b >>= 1;
a = a * a % MOD;
}
return res%MOD;
}
int main()
{
ll a,b,p;
cin >> a >> b >> p;
cout << quick_mod(a,b,p);
return 0;
}