POJ1730 Perfect Pth Powers

H - Perfect Pth Powers

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 1730

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 pth 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 pth power.

Sample Input

17
1073741824
25
0

Sample Output

1
30
2

#include<stdio.h>
#include<math.h>
int main(){
    int n;
    while(scanf("%d",&n) , n){
        int flag = 1;
        if(n<0){
            flag = -1;
        }
        int ans = 1,b,p;
        for(int p=32;p>1;p--){
            b = (int)(pow(n*1.0*flag,1.0/p)+ 1e-8 )*flag ;
            int temp = 1;
            for(int i=0;i<p;i++)
                temp *= b;
            if(temp == n){
                ans = p ;
                break;
            }
        }
        printf("%d\n",ans) ;
    }
    return 0;
}