Description
Given positive integers B and N, find an integer A such that AN is as close as possible to B. (The result A is an approximation to the Nth root of B.) Note that AN may be less than, equal to, or greater than B.
Input: The input consists of one or more pairs of values for B and N. Each pair appears on a single line, delimited by a single space. A line specifying the value zero for both B and N marks the end of the input. The value of B will be in the range 1 to 1,000,000 (inclusive), and the value of N will be in the range 1 to 9 (inclusive).
Output: For each pair B and N in the input, output A as defined above on a line by itself.
Example Input:
Example Output:
4 3
5 3
27 3
750 5
1000 5
2000 5
3000 5
1000000 5
0 0
1
2
3
4
4
4
5
16
1、题意:给你输入两个数B和N让你输出A,A为A的N次方最接近B的数。
2、思路:求B的开N次方就可求出,不过double转成int,会舍去小数,所以应该比较开出来的数以及比它大1的树。
3、代码:
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int i;
double B,N;
while(cin>>B>>N)
{
if(B==0&&N==0)
break;
i=pow(B,1/N);
if(B-pow(i,N)>pow(i+1,N)-B)
cout<<i+1<<endl;
else
cout<<i<<endl;
}
return 0;
}
4、总结:应注意double变成int会舍去小数,而不是四舍五入。