Description Current 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. This problem involves the efficient computation of integer roots of numbers. Given an integer n>=1 and an integer p>= 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 nth. power, for an integer k (this integer is what your program must find).
【题目分析】 真的是一道小水题，计算n次更号下的结果。只需要pow（x，1/n）就可以了。代码长度堪比a+b。
【代码】
#include <cstdio> #include <cmath> int main() { float n, p; while (~scanf("%f%f", &n, &p)) printf("%.0f\n", pow(p, 1 / n)); return 0; }