UVA Problem 113 Power of Cryptography Solution

Problem Solving, UVa

 

 

#include <bits/stdc++.h>

using namespace std;

int main()

{

     double n,p,ans;

   

  while(cin>>n>>p)

   {

       printf("%.0lf\n",pow(p,1/n));

    }

    return 0;

}

 

0 Comments

You may find interest following article