Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 5937 | Accepted: 3230 |
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.
Sample Input
4 3 5 3 27 3 750 5 1000 5 2000 5 3000 5 1000000 5 0 0
Sample Output
1 2 3 4 4 4 5 16
此题直接使用相邻两个数的n次幂进行比较即可。
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
String str[];
while(true)
{
str = cin.nextLine().split(" ");
if(str[0].equals("0") && str[1].equals("0"))
break;
int b = Integer.valueOf(str[0]).intValue();
int n = Integer.valueOf(str[1]).intValue();
int a = findA(b, n);
System.out.println(a);
}
}
private static int findA(int b, int n)
{
int value1, value2 = 0;
int raw1 = 1;
int raw2 = 0;
while(true)
{
raw2 = raw1 + 1;
value1 = (int)(Math.pow(raw1, n));
value2 = (int)(Math.pow(raw2, n));
if(value2 == b)
return raw2;
else if(value2 > b)
break;
else
raw1++;
}
if(Math.abs(value1-b) <= Math.abs(value2-b))
return raw1;
else
return raw2;
}
}