Power of Cryptography#1205
Given two integers n \ge 1 and p \ge 1, determine the positive -th root of . That is, find an integer such that k^n = p.
Two integers and are given (1 \leq n \leq 300, 1 \leq p \leq 10^{100}). It is guaranteed that there always exists an integer (1 \leq k \leq 10^9) such that k^n = p.
Print the value such that k^n = p.
Example 1
Example 2
Example 3