Module: The Euler function and other problems in number theory


Problem

5 /9


Raising a to the power of b modulo c

Problem

Knowing a, b, c (non-negative integers, do not exceed \(2\cdot10^ 9\) ). Evaluate a to the power of b modulo c  (\(a^b mod \ c\)).

Input
The input is three non-negative integers separated by one space.

Imprint
Display the answer to the problem.

 

Examples
# Input Output
1 2 10 1000 24

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!