문제2461--Root of the Problem

### 2461: Root of the Problem

실행시간 제한: 1 Sec  메모리사용 제한: 64 MB
제출: 5  통과: 3
[제출] [채점기록] [묻고답하기]

#### 문제 설명

Given positive integers B and N, find an non-negative 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.

#### 입력 설명

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).

#### 출력 설명

For each pair B and N in the input, output A as defined above on a line by itself.

#### 입력 예시 Copy

4 3
5 3
27 3
750 5
1000 5
2000 5
3000 5
1000000 5
0 0

#### 출력 예시 Copy

1
2
3
4
4
4
5
16