poj 3100 Root of the Problem

Root of the Problem

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9940		Accepted: 5297

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.

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

#include<iostream>
using namespace std;
int main()
{
    int b,n;
    int a;
    int i,j;
    int res;
    int min;
    
    while(1)
    {
        cin>>b>>n;
        if(b==0&&n==0)
            break;
        else
        {
            i=1;
            a=1;
            min=b;
            while(1)
            {    
                res=1;
                for(j=0;j<n;j++)
                    res*=i;
                
                if(abs(b-res)>=min)
                    break;
                min=abs(b-res);
                i++;
                a++;
            }
        }
        cout<<a-1<<endl;
    }
    return 0;
}