hdu1299 Diophantus of Alexandria

#include <iostream>
#include <cmath>
#define LL __int64
using namespace std;

const int MAXN = 40010;

LL p[MAXN];
LL prime[MAXN];
LL pcnt;
void GetPrime()
{
int i,j;
for(i=2;i<=40000;i++)
{
if(!p[i])
{
for(j=i*i;j<=40000;j+=i)
p[j]=1;
}
}
for(i=2;i<=40000;i++)
{
if(!p[i])
{
prime[++pcnt]=i;
}
}
}
int Deliver(LL n)
{
LL i,ans=1,cnt;
for(i=1;i<=pcnt && prime[i]*prime[i]<=n;i++)
{
if(n%prime[i]==0)
{
n/=prime[i];
cnt=1;
while(n%prime[i]==0)
{
cnt++;
n/=prime[i];
}
//            cout<<"--------------"<<endl;
//            cout<<prime[i]<<endl;
//            cout<<cnt<<endl;
ans*=(cnt<<1)+1;
}
}
if(n>1) ans*=3;
return ans/2+1;
}
int main()
{
int cas;
LL ans,n;
GetPrime();
cin>>cas;
for(int k=1;k<=cas;k++)
{
cin>>n;
ans=Deliver(n);
cout<<"Scenario #"<<k<<":"<<endl;
cout<<ans<<endl;
cout<<endl;
}
return 0;
}