UVA-113- Power of Cryptography

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

这是公式！