UVA 113 - Power of Cryptography Shipu Ahamed - 01 Sep 2020 Problem PDFSolution:#include #include int main() { double n,p; double s; while(scanf("%lf %lf",&n,&p)==2) { s=pow(p,1/n); printf("%.0lf\n",s); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/113/113.cpp