【CodeChef】Chef and Interview

#include<bits/stdc++.h>
using namespace std;
int T;long long n;const int upbound = 100010;
int prime[upbound],tot;bool vis[upbound];
long long ans = 0;
void getprime()
{
vis[0]=vis[1]=true;
for(int i=2;i<=upbound;i++)
{
if(!vis[i])prime[++tot]=i;
for(int j=1;j<=tot&&prime[j]<=upbound/i;j++)
{
vis[i*prime[j]]=true;
if(i%prime[j])break;
}
}
}
int e[upbound],tab[upbound],cnt;
long long mul[upbound];
int main()
{
getprime();
scanf("%d",&T);
while(T--)
{
scanf("%lld",&n);
memset(e,0,sizeof(e));
memset(mul,0,sizeof(mul));
int tmp = n;cnt = 0;
for(int i=1;i<=tot;i++)
{
if(tmp%prime[i]==0)tab[++cnt]=i;
while(tmp%prime[i]==0)
{
tmp/=prime[i];
e[i]++;
}
if(tmp==1)break;
}
for(int i=1;i<=cnt;i++)
{
long long sum = 1;
for(int j=0;j<=e[tab[i]];j++)
{
mul[i]+=sum;
sum*=prime[tab[i]];
}
}
ans = 1;
for(int i=1;i<=cnt;i++)ans*=mul[i];
printf("%lld\n",ans);
}
return 0;
}