求解快速幂

#include<iostream>
#include<algorithm>
using namespace std;

int n;

//求a^k mod p 的结果
long long pmi(int a,int k,int p){
long long res=1;
while(k){
if(k&1) res=(long long)res*a%p;
k>>=1;
a=(long long)a*a%p;
}
return res;
}
int main(){
cin>>n;
while(n--){
int a,k,p;
scanf("%d%d%d",&a,&k,&p);
cout<<pmi(a,k,p)<<endl;
}
return 0;
}