power of cryptography UVA Problem - 113 solution August 10, 2018 #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; } Tweet Share Share Share Share Related Post
