# J - Perfect Pth Powers解题报告

259人阅读 评论(0)

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;
}



0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：27186次
• 积分：678
• 等级：
• 排名：千里之外
• 原创：44篇
• 转载：0篇
• 译文：0篇
• 评论：0条
评论排行