UVA-374 Big Mod

import java.util.Scanner;
import java.math.BigInteger;
public class Main {

    public static void main(String[] args) {
       
        Scanner input=new Scanner(System.in);
        BigInteger b,p,m;
        while(input.hasNext())
        {
            b=input.nextBigInteger();
            p=input.nextBigInteger();
            m=input.nextBigInteger();
           
            System.out.println(b.modPow(p,m));    // (base,power,mod)
           
        }
       
    }

}

Download Coding Interview Book and Get More Tutorials for Coding and Interview Solution: Click Here

Download System Design Interview Book and Get More Tutorials and Interview Solution: Click Here

Do you need more Guidance or Help? Then Book 1:1 Quick Call with Me: Click Here

Share on Google Plus

About Ashadullah Shawon

I am Ashadullah Shawon. I am a Software Engineer. I studied Computer Science and Engineering (CSE) at RUET. I Like To Share Knowledge. Learn More: Click Here