poj 1730 Perfect Pth Powers

Perfect Pth Powers
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 17353 Accepted: 3980

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

解题思路：本题有两种解法，第一种是大家都能想到的暴力求解，第二种是正规一点的——整数的素因子分解。

先说第二种，有整数素数分解定理知任意一个整数都可以分解成若干个素数之积。就本题来说，他要求一个数的最高阶次幂，那么我们可以得到num = a1*a2*a3*....*an,其中几个素数可以相等，也即是可以表示成素数幂的形式。那么他的最高阶次幂就是各个素因子幂的最大公约数。最后需要注意的是本题可能出现负数，对于负数那么偶次幂是不可能的，所以要分解成奇次结果。

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

const int maxn = 100010;

int vis[maxn];
int prime[100010];
int factor[100010];
int p,num;

void FindPrime()
{
    p = 0;
    for(int i=2;i<maxn;i++){
        if(vis[i]==0){
            prime[p++] = i;
            for(int j=2*i;j<maxn;j+=i)
                vis[i]++;
        }
    }
}

int gcd(int a,int b)
{
    return b==0?a:gcd(b,a%b);
}

int main()
{
    memset(vis,0,sizeof(vis));
    FindPrime();
    //cout<<"ok"<<endl;
    while(scanf("%d",&num)!=EOF && num){
        memset(factor,0,sizeof(factor));
        for(int i=0;i<p;i++){
            while(num%prime[i]==0){
                factor[i]++;
                num/=prime[i];
            }
            //cout<<num<<endl;
        }
        //cout<<"ok"<<endl;
        int first_factor=0;
        int first = 0;
        for(int i=0;i<p;i++){
            if(factor[i]){
                if(first_factor==0){
                    first = factor[i];
                    first_factor = 1;
                }
                else
                    first = gcd(first,factor[i]);
            }
        }
        if(first_factor==0){
            printf("1\n");
            continue;
        }
        if(num<0){
            while(first%2==0)
                first/=2;
            printf("%d\n",first);
        }
        else{
            printf("%d\n",first);
        }
    }
    return 0;
}

法二，直接暴力，从头开始枚举，不过要分成正数与负数。

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;
typedef long long ll;

ll n;

int main()
{
    while(scanf("%I64d",&n)!=EOF && n){
        int flag = 1;
        ll i;
        if(n>0){
        for(i=2;i*i<=n;i++){
            ll k = n;
            int cnt = 0;
            while(k%i==0){
                k/=i;
                cnt++;
            }
            if(k==1){
                printf("%d\n",cnt);
                flag = 0;
                break;
            }
        }
        if(flag)
            printf("1\n");
        }
        else
        {
            for(i=-2;-(i*i)>=n;i--){
                ll k = n;
            int cnt = 0;
            while(k%i==0){
                k/=i;
                cnt++;
            }
            if(k==1){
                printf("%d\n",cnt);
                flag = 0;
                break;
            }
            }
            if(flag)
            printf("1\n");
        }
    }
    return 0;
}