uva 113 Power of Cryptography

题意 ：给出n和p，求k，使得k^n=p;

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        double m;
        scanf("%lf",&m);
        printf("%d\n",(int)(pow(m,1.0/n)+0.5));
    }
    return 0;
}