# J - Perfect Pth Powers解题报告

J - Perfect Pth Powers
Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

Description

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.

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>
#include<iostream>
using namespace std;
int main()
{
long double a,i,j,p,sum,num;
while(cin>>a&&a!=0)
{
sum=1,num=1;
if(a>0)
{
for(i=2;i<=sqrt(a)+1;i++)//去根号a，缩小范围
{
for(j=2;;j++)
{
for(p=0;p<j;p++)//求i的j次幂
{
sum=sum*i;
}
if(sum==a)//判断是否满足
{
num=j;
goto end;//满足的话就退出
}
if(sum>a)
{
goto top;
}
sum=1;
}
top:			sum=1;
}
}
else
{
sum=1,num=1;
a=-a;
for(i=2;i<=sqrt(a)+1;i++)
{
for(j=3;;j+=2)//负数和正数不一样，只能为奇数
{
for(p=0;p<j;p++)
{
sum=sum*i;
}
if(sum==a)
{
num=j;
goto end;
}
if(sum>a)
{
goto top1;//不满足的话继续进行
}
sum=1;
}
top1:			sum=1;
}
}
end:;
cout<<num<<endl;
}

return 0;
}



#### Perfect Pth Powers解题报告

2012-03-30 08:34:41

#### poj 1730Perfect Pth Powers（分解质因数）

2014-10-18 12:26:32

#### poj1730 - Perfect Pth Powers

2012-08-05 09:24:33

#### J - Perfect Pth Powers解题报告（张宇）

2012-04-17 21:52:34

#### J - Perfect Pth Powers解题报告（陈渊）

2012-04-17 19:55:58

#### poj1730——Perfect Pth Powers

2011-06-28 23:56:00

#### poj-1730 Perfect Pth Powers

2012-03-28 12:35:57

#### Perfect Pth Powers（ZJU_2124）

2006-03-26 11:30:00

#### Perfect Pth Powers

2014-08-20 11:26:34

#### poj-1730 Perfect Pth Powers

2012-03-28 23:05:21