[UVA][D&C] 1230 - MODEX
Many well-known cryptographic operations require modular exponentiation. That is, given integers x
, y
and n
, compute
xy mod n
. In this question, you are tasked to program an efficient way to execute this calculation.
Input
The input consists of a...
