POJ 1730 Perfect Pth Powers

Perfect Pth Powers

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 9722		Accepted: 2139

Description

We say that x is a perfect square if, for some integer b, x = b ². Similarly, x is a perfect cube if, for some integer b, x = b ³. More generally, x is a perfect pth power if, for some integer b, x = b ^p. Given an integer x you are to determine the largest p such that x is a perfect p th power.

Input

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.

Output

For each test case, output a line giving the largest integer p such that x is a perfect p th power.

Sample Input

17
1073741824
25
0

Sample Output

1
30
2

Source

Waterloo local 2004.01.31

 

/* 有一种搞法叫逆向思维，一开始想用纯数论质因子分解的方法做，TLE未果 后来看了DISCUSS的讨论才知道可以逆向用高精度来做，遂AC */ #include <iostream> #include <cmath> #define MAX_N 1000 #define EPS 1E-12 using namespace std; int getP(double num) { int start = 32, f = 1; if(num < 0){start = 31; f = 2; num = -num;} double val; __int64 temp1, temp2; int p; for(p = start; p >= 1; p -= f) { val = pow(num, 1.0 / p); temp1 = val; temp2 = val + 1; if(val - temp1 <= EPS || temp2 - val <= EPS) break; } return p; } int main() { //cout<<getP(INT_MAX)<<endl; int num; while(scanf("%d", &num) && num != 0) { int p = getP(num); printf("%d/n", p); } return 0; }