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 |
#include<stdio.h>
#include<math.h>
int t;
int pow(int a,int n){
int i=1;
t=a;
for(i;i<n;i++){
t *= a;
}
return t;
}
int main(){
int B,N,A;
int y;
while(scanf("%d%d",&B,&N),B||N){ //自己摸索的,呵呵,当输入0 0 时结束
for(A=1;(B-pow(A,N))>0;A++){
}
y=pow(A,N)-B;
(B-pow(A-1,N)>=y)?(printf("%d\n",A)):(printf("%d\n",A-1));
}
}