Uva 113 - Power of Cryptography

Problem: 113 - Power of Cryptography

Explain:

Now just use pow() function.

Code:

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

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