lightoj 1220 - Mysterious Bacteria 【数学】

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#define PI acos(-1.0)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define fi first
#define se second
#define ll o<<1
#define rr o<<1|1
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e7 + 1;
const int pN = 1e6;// <= 10^7
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
void getmax(int &a, int b) {a = max(a, b); }
void getmin(int &a, int b) {a = min(a, b); }
void add(LL &x, LL y) { x += y; x %= MOD; }
pii a[60]; int k;
void getp(LL n)
{
k = 0;
for(LL i = 2; i * i <= n; i++) {
if(n % i == 0) {
a[k].fi = i;
int cnt = 0;
while(n % i == 0) {
n /= i; cnt++;
}
a[k++].se = cnt;
}
}
if(n > 1) {
a[k].fi = n;
a[k++].se = 1;
}
}
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a%b);
}
bool judge(int p) {
for(int i = 0; i < k; i++)
if(a[i].se % p) return false;
return true;
}
int main()
{
int t, kcase = 1; scanf("%d", &t);
while(t--)
{
LL n; scanf("%lld", &n); bool flag = false;
if(n < 0) {
flag = true;
n = -n;
}
getp(n); int ans;
if(flag) {
for(int i = 32; i >= 1; i--) {
if(judge(i) && i & 1) {
ans = i;
break;
}
}
}
else {
for(int i = 32; i >= 1; i--) {
if(judge(i)) {
ans = i;
break;
}
}
}
printf("Case %d: %d\n", kcase++, ans);
}
return 0;
}