$quick$ $pow$
注意res = 1 % p
CODE(CPP)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b,p;
ll muli(ll a,ll b,ll p){
ll res = 1%p;
while(b){
if(b&1){
res = (res * a) % p;
}
a = (a*a) % p;
b >>= 1;
}
return res;
}
int main(){
scanf("%lld%lld%lld",&a,&b,&p);
printf("%lld",muli(a,b,p));
return 0;
}