Minimal Power of Prime

http://acm.hdu.edu.cn/showproblem.php?pid=6623 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
#include <ctime>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
//#define pii pair<int,int>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e4+9;
const int maxm=1e6;
const int mod=1e9+7;

bool vis[maxn+9];
ll pre[maxn+9];
int cnt=0;
void P()
{
    for(int i=2;i<maxn;i++)
    {
        if(!vis[i])
        {
            pre[cnt++]=i;
            for(int j=i+i;j<maxn;j+=i) vis[j]=1;
        }
    }
}

bool ch(ll n)
{
    ll l=1;
    ll r=pow(n*1.0,1.0/3.0)+1;
    while(l<=r)
    {
        ll mid=(l+r)>>1;
        ll tmp=mid*mid*mid;
        if(tmp==n) return 1;
        else if(tmp>n) r=mid-1;
        else l=mid+1;
    }
    return 0;
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    P();
    int T;
    read(T);
    while(T--)
    {
        ll n;
        read(n);

        int ans=INF;
        int num=0;

        for(int i=0;i<cnt&&pre[i]<=n;i++)
        {
            if(n%pre[i]==0)
            {

                num=0;
                while(n%pre[i]==0) n/=pre[i],num++;
                //cout<<n<<" "<<pre[i]<<" "<<num<<endl;

                ans=min(ans,num);
            }
        }
        if(n==1)
        {
            printf("%d\n",ans);
        }
        else if(ans==1)
        {
            printf("%d\n",ans);
        }
        else if(n>1)
        {
            ll a=(ll)sqrt(sqrt(n*1.0));
            ll b=(ll)sqrt(n*1.0);
            if((a*a*a*a)==n) ans=min(ans,4);
            else if(ch(n)) ans=min(ans,3);
            else if(b*b==n) ans=min(ans,2);
            else ans=1;
            printf("%d\n",ans);
        }

    }


    return 0;
}