Pagini recente » Cod sursa (job #2356347) | Cod sursa (job #2413042) | Cod sursa (job #1143429) | Cod sursa (job #1090449) | Cod sursa (job #2311265)
#include <bits/stdc++.h>
#define MAXNR 1000000
/// TONI BO$$ was here
/// #MLC
using namespace std;
char ciur[MAXNR+1];
int prime[MAXNR/10+1];
int main()
{
int i,j,n,t,ct,e;
long long x,nrdiv,sumdiv,fact;
freopen("ssnd.in","r",stdin);
freopen("ssnd.out","w",stdout);
for(i=2; i*i<=MAXNR; i++)
if(!ciur[i])
for(j=i*i; j<=MAXNR; j+=i)
ciur[j]=1;
ct=0;
for(i=2; i<=MAXNR; i++)
if(!ciur[i])
prime[++ct]=i;
scanf("%d",&t);
while(t--)
{
scanf("%lld",&x);
ct=1;
nrdiv=1;
sumdiv=1;
while(prime[ct]*prime[ct]<=x)
{
e=0;
fact=1;
while(x%prime[ct]==0)
{
fact*=prime[ct];
x/=prime[ct];
e++;
}
nrdiv*=(e+1);
sumdiv*=((prime[ct]*fact-1)/(prime[ct]-1));
ct++;
}
if(x>1)
{
nrdiv*=2;
sumdiv*=((x*x-1)/(x-1));
}
printf("%lld %lld\n",nrdiv,sumdiv);
}
return 0;
}