#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL quick(LL a,LL k,LL p){
LL ans = 1;
while(k){
if(k%2==1)ans = ans*a%p;
a = a*a%p;
k/=2;
}
return ans;
}
int main(){
int n;
scanf("%d",&n);
while(n--){
LL a,k,p;
scanf("%lld%lld%lld",&a,&k,&p);
printf("%lld\n",quick(a,k,p));
}
}
快速幂
最新推荐文章于 2024-10-02 23:40:03 发布