Mysterious Bacteria LightOJ - 1220[唯一分解定理+思维题]

题目大意：就是给你一个数n问这个数是什么数的整数幂，输出这个幂指数，如果有多个输出幂指数最大的那个

---

就是对于一个数$n=p_1^{a_1}\ast p_2^{a_2}\ast ...\ast p_x^{a_x}$,求这个数是哪个数的多少幂次就是$ans=gcd(a_1,a_2,a_3,...a_x)$然后$n=(p_1^{a_1/ans}\ast p_2^{a_2/ans}\ast ...\ast p_x^{a_x/ans}{)}^{ans}$

---

但是这里的n有可能是负数，那么如果$ans是偶数的话也不一定错，我们可以让它一直除以2直到\%2！=0$为止

---

#include <iostream>
#include <cstdio>
#include <stack>
#include <sstream>
#include <vector>
#include <map>
#include <cstring>
#include <deque>
#include <cmath>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <set>
#define mid ((l + r) >> 1) 
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define _for(i,a,b) for( int i = (a); i < (b); ++i)
#define _rep(i,a,b) for( int i = (a); i <= (b); ++i)
#define for_(i,a,b) for( int i = (a); i >= (b); -- i)
#define rep_(i,a,b) for( int i = (a); i > (b); -- i)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define hash Hash
#define next Next
#define count Count
#define pb push_back
#define f first
#define s second
using namespace std;
const int N = 1e5+10, mod = 1e9 + 7;
const double eps = 1e-10;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) 
{
    read(first);
    read(args...);
}
ll prime[N], cnt;
bool vis[N];
int T;
ll n;

inline void init(ll n)
{
    for(int i = 2; i <= n; ++ i)
    {
        if(!vis[i]) prime[cnt ++] = i;
        for(int j = 0; i * prime[j] <= n; ++ j)
        {
            vis[prime[j] * i] = true;
            if(i % prime[j] == 0) break;
        }
    }
}

inline int solve(ll n)
{
    int tmp = n;
    if(n < 0) n = -n;
    int ans = 0;
    for(ll i = 0; prime[i] <= n / prime[i]; ++ i)
    {
        int c = 0;
        if(n % prime[i] == 0)
        {
            while(n % prime[i] == 0) n /= prime[i], c ++;
            ans = __gcd(ans,c);
        }
    }
    if(!ans) return 1;
    while(tmp < 0 && ans % 2 == 0)  ans /= 2;
    return ans;
}

int main()
{
    init(N-1);
    read(T);
    int c = 1;
    while(T --)
    {
        read(n);
        printf("Case %d: %lld\n",c++,solve(n));
    }
    return 0;
}

---