UVA 113 - Power of Cryptography

UVA 113 - Power of Cryptography

#include<cmath>
#include<cstdio>
int main() {
double a;
double s;

while (scanf("%lf%lf", &a, &s) != EOF)
{
int beg = 0, end = 1000000000;
while (1)
{
int mid = (beg + end) / 2;
if (pow(mid,a)>s)
end = mid - 1;
else if (pow(mid,a)<s)
beg = mid + 1;
else
{
printf("%d\n", mid);
break;
}
}
}
return 0;
}