当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3100：Root of the Problem

题目描述

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.

输入解释

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.

输入样例 
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
该题目是Virtual Judge题目，来自 北京大学POJ
题目来源 Mid-Central USA 2006
源链接： POJ-3100
最后修改于 2020-10-29T06:52:35+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
1000 65536