Power of Cryptography

题意：给出两个数一个n，一个p,求k。满足k^n==p

解题技巧：（q^（1/n）^n==q

k==（q^（1/n）;

#include <iostream>#include <cstring>#include <cmath>#include <cstdio>using namespace std;double a,b,x;int main(){    while(~scanf("%lf%lf",&a,&b))    {        //cout<<b<<endl;        x=pow(b,1.0/a);        //cout<<b<<"  "<<1.0/a*1.0<<endl;        cout<<x<<endl;    }    return 0;}