题意:求最大的P值,使得x=b^p。b可以为任意值。需要注意的是x有可能为负数,题中“ magnitude at least 2”应该指的是|X|>=2.
题解:sqrt(2^32) = 65536,可以事先求出这个范围内的所有素数。然后在素数中找出x的因素,x=(p1^k1)*(p2^k2)*(p3^k3)*(p4^k4)····。最后对k1,k2···求一次最大公约数。若x<0,那么p只能是奇数。
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
#define lint __int64
const lint MAX = 66666;
lint p[7000], a[MAX], pn;
lint f[7000];
lint gcd ( lint a, lint b )
{
if ( b == 0 )
return a;
return gcd ( b, a % b );
}
void prime ()
{
lint i, j; pn = 0;
memset(a,0,sizeof(a));
for ( i = 2; i < MAX; i++ )
{
if ( ! a[i] ) p[pn++] = i;
for ( j = 0; j < pn && i*p[j] < MAX && ( p[j] <= a[i] || a[i] == 0 ); j++ )
a[i*p[j]] = p[j];
}
}
void split ( lint n )
{
lint s = sqrt(n+0.0);
for ( lint i = 0; i < pn; i++ )
{
if ( p[i] > s || p[i] > n ) break;
while ( n % p[i] == 0 )
{
f[i]++;
n = n / p[i];
}
}
}
int main()
{
prime(); //printf("%d\n",pn);
lint x, d;
while ( scanf("%I64d",&x) && x )
{
bool minu = false;
if ( x < 0 ) { minu = true; x = -x; }
memset(f,0,sizeof(f));
split(x);
d = 0;
for ( lint i = 0; i < pn && p[i] <= x; i++ )
if ( f[i] ) d = gcd(d,f[i]);
if ( d == 0 ) d = 1;
if ( minu ) while ( d % 2 == 0 ) d >>= 1;
printf("%I64d\n",d);
}
return 0;
}