poj 1730 -- Perfect Pth Powers

http://poj.org/problem?id=1730

 

Perfect Pth PowersTime Limit: 1000MS Memory Limit: 10000K
Total Submissions: 11102 Accepted: 2475


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

 

题意 ：x=b^p;

 

给出x求最大的p

 

 

这题居然有负数的输入！！！！太黑了。 

 

水过不解释。 

 

 

//188K 0MS #include <IOSTREAM> #include <CMATH> using namespace std; __int64 Iow(__int64 n,int k) { __int64 c=n; for(int i=1;i<k;i++) n*=c; return n; } int main() { double n; __int64 n2,i; while(scanf("%I64d",&n2)&&n2!=0) { n=n2; bool judge=false; if(n2<0) { judge=true; n=-n; n2=-n2; } for(i=32;i>=2;i--) { __int64 t=pow(n,1.0/i); if(Iow(t,i)==n2) { if(judge) { if(i%2) { printf("%d/n",i); break; } } else { printf("%d/n",i); break; } } if(Iow(t-1,i)==n2) { if(judge) { if(i%2) { printf("%d/n",i); break; } } else { printf("%d/n",i); break; } } if(Iow(t+1,i)==n2) { if(judge) { if(i%2) { printf("%d/n",i); break; } } else { printf("%d/n",i); break; } } } if(i<2) printf("1/n"); } }