{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003eCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among 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 only of theoretical interest. \n\u003cbr\u003eThis problem involves the efficient computation of integer roots of numbers. \n\u003cbr\u003eGiven an integer n\u0026gt;\u003d1 and an integer p\u0026gt;\u003d 1 you have to write a program that determines the n th positive root of p. In this problem, given such integers n and p, p will always be of the form k to the n\u003csup\u003eth\u003c/sup\u003e. power, for an integer k (this integer is what your program must find). \u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003eThe input consists of a sequence of integer pairs n and p with each integer on a line by itself. For all such pairs 1\u0026lt;\u003dn\u0026lt;\u003d 200, 1\u0026lt;\u003dp\u0026lt;10\u003csup\u003e101\u003c/sup\u003e and there exists an integer k, 1\u0026lt;\u003dk\u0026lt;\u003d10\u003csup\u003e9\u003c/sup\u003e such that k\u003csup\u003en\u003c/sup\u003e \u003d p. \u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003eFor each integer pair n and p the value k should be printed, i.e., the number k such that k n \u003dp. \u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e2 4\n2 16\n3 9\n3 27\n7 4357186184021382204544\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e2\n4\n2\n3\n1234\u003c/pre\u003e"}}]}