poj 2109

#include <iostream>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long LL;
int main()
{
    LL left,right,mid;
    double n,p;
    while(cin>>n>>p)
    {
        left=0,right=1000000;
        while(right-0.00001>left)
        {
            mid=(left+right)/2;
            if(pow(mid,n)-p>0)
               right=mid;
            else if(pow(mid,n)-p<0)
                       left=mid;
                    else {
                              printf("%d\n",mid);
                              break;
                            }
        }
    }
    return 0;
}