UVa 113 - Power of Cryptography solution

Problem link :  UVa 113 - Power of Cryptography

Solution :


#include<stdio.h>
#include<math.h>
int main()
{
    double n,p,i,j;
    while(scanf("%lf %lf",&n,&p)==2)
    {
        i=1/n;
        j=pow(p,i);
        printf("%.0lf\n",j);
    }
    return 0;
}