UVA 10622(p343)----Perfect Pth Powers

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long LL;
int num;
inline LL mul(int i,int j)
{
    LL temp=1;
    for(int k=1;k<=j;k++)
        temp*=i;
    return temp;
}
int main()
{
   // freopen("in.in","r",stdin);
    //freopen("out.out","w",stdout);
    LL x,xx,ans,f;
    while(scanf("%lld",&x)!=EOF&&x)
    {
       f=0;xx=abs(x);
       for(int i=2;i<=floor(sqrt(xx));i++)
         {
            f=0;
            for(int j=2;j<40;j++)
              {
                 LL temp=mul(i,j);
                 if(temp>xx) break;
                 if((temp==xx&&x>0)||(temp==xx&&x<0&&(j&1))) {f=1;ans=j;break;}
                 //cout<<"i "<<i<<" "<<"temp "<<temp<<" "<<"j "<<j<<endl;
              }
            if(f) {printf("%lld\n",ans);break;}
        }
      if(!f) printf("%d\n",1);
    }
    return 0;
}