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

J - 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 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

我发现写解题报告还是很有好处的，所以从今天起好好的写解题报告。
这个题目的大意就是给出一个数a，找到一个数的p次幂等于这个数，要求是p是最大的。
我首先将输入的数a开根号，因为除了1，p的最小的数就是2了（负数就另当别论了），然后取t=2~sqrt（a），求t的p次幂，因为t是从小到大，如果有p满足就一定是最大的，所以找到了p就马上退出，输出。
负数的话，还是先开根号，不过要注意的是负数的p一定是奇数哈，完了，有错误请纠正。
代码如下：

[cpp]  view plain copy

1. #include<stdio.h>  
2. #include<math.h>  
3. #include<iostream>  
4. using namespace std;  
5. int main()  
6. {  
7.     long double a,i,j,p,sum,num;  
8.     while(cin>>a&&a!=0)  
9.     {  
10.          sum=1,num=1;  
11.          if(a>0)  
12.          {  
13.              for(i=2;i<=sqrt(a)+1;i++)//去根号a，缩小范围  
14.             {  
15.                 for(j=2;;j++)  
16.             {  
17.                 for(p=0;p<j;p++)//求i的j次幂  
18.                 {  
19.                     sum=sum*i;  
20.                 }  
21.                 if(sum==a)//判断是否满足  
22.                     {  
23.                         num=j;  
24.                         goto end;//满足的话就退出  
25.                     }  
26.                     if(sum>a)  
27.                     {  
28.                         goto top;  
29.                     }  
30.                 sum=1;  
31.             }  
32. top:            sum=1;  
33.          }  
34.          }  
35.          else  
36.          {  
37.               sum=1,num=1;  
38.              a=-a;  
39.               for(i=2;i<=sqrt(a)+1;i++)  
40.             {  
41.                 for(j=3;;j+=2)//负数和正数不一样，只能为奇数  
42.             {  
43.                 for(p=0;p<j;p++)  
44.                 {  
45.                     sum=sum*i;  
46.                 }  
47.                 if(sum==a)  
48.                     {  
49.                         num=j;  
50.                         goto end;  
51.                     }  
52.                     if(sum>a)  
53.                     {  
54.                         goto top1;//不满足的话继续进行  
55.                     }  
56.                 sum=1;  
57.             }  
58. top1:           sum=1;  
59.             }  
60.          }  
61.         end:;  
62.     cout<<num<<endl;  
63.     }  
64.   
65.         return 0;  
66. }