Submission #691254

---

Source Code Expand

import java.util.Scanner;
public class Main{
	public static void main(String[] args)throws Exception{
		new Main().solve();
	}
	void solve(){
		Scanner sc=new Scanner(System.in);
		long n=sc.nextLong();
		long m=sc.nextLong();
		long p=sc.nextLong();
		n%=m;
		//n^p mod m
		long ans=1;
		long pow=n;
		while(p>=1){
			if(p%2==0){
				pow*=pow;
				pow%=m;
				p/=2;
			}else if(p%2==1){
				ans*=pow;
				ans%=m;
				p--;
			}
		}
		System.out.println(ans);
	}
}

Submission Info

Judge Result