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

建议使用的浏览器：

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

1730：Perfect Pth Powers

题目描述
We say that x is a perfect square if, for some integer b, x = b2. Similarly, x is a perfect cube if, for some integer b, x = b3. More generally, x is a perfect pth power if, for some integer b, x = bp. Given an integer x you are to determine the largest p such that x is a perfect pth power.
输入解释
Each test case is given by a line of input containing x. The value of x will have magnitude at least 2 and be within the range of a (32-bit) int in C, C++, and Java. A line containing 0 follows the last test case.
输出解释
For each test case, output a line giving the largest integer p such that x is a perfect pth power.
输入样例 
17
1073741824
25
0
输出样例 
1
30
2
该题目是Virtual Judge题目，来自 北京大学POJ
题目来源 Waterloo local 2004.01.31
源链接： POJ-1730
最后修改于 2020-10-29T06:12:29+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
1000 10000