题目:113 - Power of Cryptography
题目大意:求k,k^n = p;
解题思路:k = p ^ (1/n);并且double的上限是1.7E+308,p的范围是1.0E + 101.
#include<stdio.h>
#include<math.h>
int main() {
double p, n;
while (scanf("%lf%lf", &n, &p) != EOF) {
printf("%.lf\n", pow(p, 1/n));
}
return 0;
}