UVA 113 Power of Cryptography Solution

#include<stdio.h>
#include<math.h>

int main()
{
double n,p;
double ans;
while(scanf("%lf%lf",&n,&p)==2)
{
ans=pow(p,1/n);
printf("%.0lf\n",ans);
}
return 0;
}