POJ 1730 Perfect Pth Powers

We say that x is a perfect square if, for some integer b, x = b 2. Similarly, x is a perfect cube if, !some integer b, x = b 3. 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

题意描述：
给出一个n找出n=x 的P次方这个等式成立时的最大P。

解题思路：
先用筛法去查出100000内的所有素数（这个相当于打了一个表），然后再去求出n的所有质因子，和每个质因子的个数，然后就是求出这些质因子个数的最大公约数。
注意：
当n为负数且P为偶数时，需要去进行一步操作：

 if(flag==1)
		 {
		 	while(count%2 == 0)
		 		count/=2;
		 	printf("%d\n",count);
		 }

AC代码：

#include<stdio.h>
#include<math.h>
#define N 100000

int ans;
int isprime[20000];
int is[N+1000];

void prime()//筛法求素数
{
	int i,j,k;
	for(i=0;i<N;i++)
		is[i]=1;
	ans=0;
	is[0]=is[1]=0;
	k=sqrt(N+0.5);
	for(i=2;i<N;i++)
	{
		if(is[i])
		{
			isprime[ans++]=i;
			if(i<=k)
			{
				for(j=i*i;j<N;j+=i) 
					is[j]=0;
			}
		}
	}
 } 
 int gcd(int a,int b)//求质因子个数的最大公约数
 {
 	if(b==0)
 		return a;
 	return gcd(b,a%b);
 }
 
 int main()
 {
 	prime();
 	int i,j,cnt,count;
 	long long int n;
 	while(~scanf("%lld",&n))
 	{	
	 	int flag=0;
	 	if(n<0)
 		{
 			flag=1;
 			n=-n;
		}

 		if(n==0)
 			break;
 		count=0;
 		for(i=0;i<ans&&n>1;i++)
 		{
 			if(n%isprime[i]==0)
 			{
 				cnt=0;
 				while(n%isprime[i]==0)
 				{
 					cnt++;
 					n/=isprime[i];
				 }
				 count=gcd(cnt,count);
			 }
		 }
		 if(n>1)//这个不写会出现WA
		 	count=gcd(count,1);
		 if(flag==1)
		 {
		 	while(count%2 == 0)
		 		count/=2;
		 	printf("%d\n",count);
		 }
		 else
		 	printf("%d\n",count);
	 }
  return 0;
}