UVA 113 - Power of Cryptography
Problem PDF
Solution:
#include
#include
int main()
{
double n,p;
double s;
while(scanf("%lf %lf",&n,&p)==2)
{
s=pow(p,1/n);
printf("%.0lf\n",s);
}
return 0;
}
#include
#include
int main()
{
double n,p;
double s;
while(scanf("%lf %lf",&n,&p)==2)
{
s=pow(p,1/n);
printf("%.0lf\n",s);
}
return 0;
}
