UVA Solution 113 - Power of cryptography | Volume 1

UVA Online Judge Solution 113 - Power of cryptography | Volume 1

Get UVA online Judge Solution free. This is UVA 113 Solution in cpp

UVA Solution 113 - Power of cryptography | Volume 1:

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