ACM: 一道数论题 poj1730  (做了好…

 

                                                                    Perfect Pth Powers

 

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 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 , p的MAX值.

个人思路：

             1.讲x素数拆分. x = (b1^k1) * (b2^k2) * (b3^k3) * ... * (bn^kn).

             2.求出(k1,k2,k3,...,kn)值. (a,b) : 表示a,b的最大公约数.

              3.明显求出来的值就是结果.

             (不信可以自己举例试一试,纯粹数学功底问题,还是多次wrong answer才过了,有坑爹的负数T.T) 

 

代码：

#include <cstdio>
#include <iostream>
#include <string.h>
#include <math.h>
using namespace std;
#define MAX 10005

__int64 a[MAX];

__int64 gcd(__int64 a,__int64 b)
{
          if(b == 0)
             return a;
         else
             return gcd(b,a%b);
}

__int64 divide(__int64 n)
{
         memset(a,0,sizeof(a));
        __int64 i , k = 0;
        for(i = 2; i <= sqrt(double(n)); ++i)
       {
            if(n % i == 0)
           {
               while(n % i == 0)
              {
                   n = n/i;
                   a[k]++;
              }
              k++;
           }
      }

      if(n != 1)
     {
           a[k]++;
           k++;
     } 
     return k;
}

int main()
{
      __int64 n;

      while(scanf("%I64d",&n) && n != 0)
      {
           __int64 gc = 0, num;
           __int64 i;
           int flag = 0;
           if(n < 0)
          {
                flag = 1;
                n = (-1)*n;
          }
  
           num = divide(n);

          for(i = 0; i < num; ++i)
         {
                 gc = gcd(gc,a[i]);
         }

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

   return 0;
}