模运算
(a+b) mod m =( (a mod m) + (b mod m) ) mod m
(a-b) mod m =( (a mod m) - (b mod m) ) mod m
(a*b) mod m =( (a mod m) * (b mod m) ) mod m
快速幂
package aaa;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int a=scanner.nextInt();
int n=scanner.nextInt();
int mod=scanner.nextInt();
System.out.println(fastpow(a,n,mod));
}
public static long fastpow(long a,long n,long mod){
long ans=1;
a=a%mod;
while (n!=0){
if (n%2==1)
ans=(ans*a)%mod;
a=a*a%mod;
n=n/2;
}
return ans;
}
}