UVA 113 (Power of Cryptography )Solution
Solve in C:
#include<stdio.h>
#include<math.h>
int main()
{
double p,n,r;
while(scanf("%lf%lf",&n,&p)!=EOF)
{
r=pow(p,1/n);
printf("%.0lf\n",r);
}
}
#include<stdio.h>
#include<math.h>
int main()
{
double p,n,r;
while(scanf("%lf%lf",&n,&p)!=EOF)
{
r=pow(p,1/n);
printf("%.0lf\n",r);
}
}
No comments