AcWing 875. 快速幂
原题链接
简单
作者:
Sei
,
2019-09-11 18:27:51
,
所有人可见
,
阅读 920
java 代码
import java.util.*;
public class Main{
public static void main(String[] args){
long a, b, p;
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i =0;i<n;i++){
a = sc.nextLong();
b = sc.nextLong();
p = sc.nextLong();
System.out.println(fastPow(a, b, p));
}
}
public static long fastPow(long a, long b, long p){
long res = 1%p, base = a;
while(b!=0){
if((b&1)==1){res=(res*base)%p;}
base = base*base%p;
b>>=1;
}
return res;
}
}