ZOJ.2818 Root of the Problem【开根号，水】 2015/09/22

Root of the Problem

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

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

---

Source: Mid-Central USA 2006

对b求对数，但是log函数不可用，只能暴力枚举，n=1或2时比较容易求，n>=3时从1到100枚举即可。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>

using namespace std;

int main(){
    int n,b,a;
    while( ~scanf("%d %d",&b,&n) ){
        if( !b && !n ) break;
        if( n == 1 )
            printf("%d\n",b);
        else if( n == 2 ){
            a = (int)sqrt(b);
            if( b-a*a > (a+1)*(a+1)-b )
                printf("%d\n",a+1);
            else printf("%d\n",a);
        }
        else{
            int ret = 1000000,ans,res;
            for( a = 1 ; a <= 100 ; ++a ){
                ans = pow(a,n);
                if( ret > fabs(b-ans) ){
                    ret = b-ans;
                    res = a;
                }
                if( ans > b ) break;
            }
            printf("%d\n",res);
        }
    }
    return 0;
}