C++ Solution For UVa Problem: Power of Cryptography - 113.cpp
113.cpp, C++ Solution of problem: UVa 113 - Power of Cryptography. In this post we will see how we can solve this challenge in C++ for UVa Online Judge.
Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers modulo functions of these primes. Work in this area has resulted in the practical use of results from number theory and other branches of mathematics once considered to be of only theoretical interest.
This problem involves the efficient computation of integer roots of numbers.
You can find the full details of the problem Power of Cryptography at UVa Online Judge
Solution: Please check the 113.cpp snippet for the solution.
Solution originally posted at: Github by @SITZ