ACwing（基础）--- 快速幂

#include<iostream>
#include<algorithm>

using namespace std;
typedef long long LL;
//a^k%p
int qmi(int a,int k,int p){
	int res = 1;
	while(k){
		if(k & 1) res = (LL)res*a%p;
		k >>= 1;
		a = (LL)a*a%p;
	}
	return res;
}

int main()
{
	int n; scanf("%d",&n);
	while(n -- ){
		int a,k,p;
		scanf("%d%d%d",&a,&k,&p);
		
		printf("%d
",qmi(a,k,p));
	}
	return 0; 
}