POJ 2109 Power of Cryptography

                 K^N = P 给出P和N 求K ，1<=n<= 200, 1<=p<10¹⁰¹ ；

                 K=P^(1/N) ，K=log(p)/log(n);

                 

本来想用JAVA做 - - 结果被我看到了这个神一样的代码                 

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
	double n,p;
	while(scanf("%lf %lf", &n, &p)!=EOF)
	{
		printf("%.0lf\n",pow(p, 1/n));
	}
	return 0;
}