UVa - 113 ( Power Of Cryptography Solution )

Tips : Try Yourself First . For Help Scroll Down.

Code :

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

=> Questions ?? Leave A Comment .