UVa 113

From Algorithmist

Contents 1 113 - Power of Crytography 2 Summary 3 Explanation 4 Notes 5 Input 6 Output

[edit] 113 - Power of Crytography

• http://acm.uva.es/p/v1/113.html

[edit] Summary

Given p and n, calculate . We can solve this by using Logarithms.

[edit] Explanation

Recall that in Logarithms:

kⁿ = p

is equivalent to

lnkⁿ = lnp

which is simply

nlnk = lnp

or

thus k is:

[edit] Notes

• Double should be enough.

[edit] Input

2
16
3
27
7
4357186184021382204544

[edit] Output

4
3
1234