///2014.3.2
///poj2109
/**
*解法来自csdn上“ζёСяêτ - 小優YoU”的博客
*原博客链接:
* http://blog.csdn.net/lyy289065406/article/details/6642602
*/
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main( )
{
// freopen("in","r",stdin);
// freopen("out","w",stdout);
double n,p;
while( scanf("%lf%lf",&n,&p)!=EOF ){
cout<<pow(p,1.0/n)<<endl;
}
return 0;
}
poj2109 Power of Cryptography
最新推荐文章于 2018-02-04 20:32:00 发布