power of cryptography UVA Problem - 113 solution

power of cryptography UVA Problem - 113 solution

August 10, 2018
www.ebatayon.com

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

    return 0;
}