| Time Limit: 1000MS | Memory Limit: 30000K | |
| Total Submissions: 18408 | Accepted: 9292 |
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main()
{
double n,m;
while(cin>>n>>m)
cout<<pow(m,1/n)<<endl;
return 0;
}
poj 2109 Power of Cryptography,布布扣,bubuko.com
poj 2109 Power of Cryptography
原文：http://blog.csdn.net/fanerxiaoqinnian/article/details/37961551