An easy problem,help - Programmers Heaven

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!


Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

An easy problem,help

Nemanja1234Nemanja1234 Posts: 2Member
For the given numbers O, S, M calculate the Sth exponent of number O, with modulus M.

The first and only line of the standard input contains the numbers O, S, M. (0 < O <= 2000000000), (0 < S <= 20000000000). (0 < M <= 4000).

To the standard output write one number that is the result of (O^S) mod M.

2 10 10


(2 ^ 10) mod 10 = 1024 mod 10 = 4

Time: 0.1 sec.
Can u help me plz
Sign In or Register to comment.