《ACM程序设计》书中题目 T - 20 A的N次方近似于B

Description

Given positive integers B and N, find an integer A such that A^N is as close as possible to B. (The result A is an approximation to the Nth root of B.) Note that A^N 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

    这道题的基本题意为输入两个数B和N，然后找一个数A，使得A的N次方最接近于B，A的N次方可以小于B，可以等于B，也可以大于B。

     基本思路为用二重循环找到A的N次方离的B最近的那个小于B的跟大于B的，比较他们的差值，输出差值小的那个对应的A，如果存在A的N的次方跟B相等，则直接输出这个A的值。

源代码如下：

#include<bits/stdc++.h>
using namespace std;
int main()
{ int i,j,a,b,n,x,y,p,m;
  while(cin>>b>>n&&b!=0&&n!=0)
  { 
      for(i=1;;++i)
      {
   for(p=1,j=1;j<=n;++j)
           p=p*i;
       if(p==b)
{
cout<<i<<endl;
break;
   }
        else if(p>b)
            { if(b-x<p-b)cout<<i-1<<endl;
              else cout<<i<<endl;
              break;
   }
x=p;
   }
  }
} 

    需要注意的地方就是达到条件时要用break控制循环结束。