Pagini recente » Cod sursa (job #2192876) | Solutii Autumn Warmup, Runda 3 | Cod sursa (job #3140766) | Cod sursa (job #255512) | Cod sursa (job #1607792)
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
#define SIZE 1000003
bool fr[SIZE];
int v[75000];
int powi(int x, int pow){
int s=1;
for(int i=0;i<pow;i++){
s*=x;
}
return s;
}
int main()
{
int t,s,con,c,d,x,conj,srt,cd,l,m,n;
freopen("ssnd.in","r",stdin);
freopen("ssnd.out","w",stdout);
scanf("%d ",&t);
fr[2]=0;
int sqrtSize=sqrt(SIZE);
for(int i=2; i<=sqrtSize; i++)
{
if(fr[i]==0)
{
con=2;
d=i;
s=d*con;
while(s<=SIZE)
{
fr[s]=1;
s=d*con;
con++;
}
}
}
c=0;
int u=0;
for(int i=2; i<=1000000; i++)
{
if(fr[i]==0)
{
c++;
u++;
v[u]=i;
}
}
for(int i=1; i<=t; i++)
{
scanf("%d ",&x);
conj=1;
double b=x;
srt=sqrt(b);
s=1;
cd=1;
while(v[conj]<=srt )
{
con=0;
while(x%v[conj]==0)
{
con++;
x=x/v[conj];
}
cd=cd*(con+1);
n=powi(v[conj],(con+1))-1;
m=v[conj]-1;
l=n/m;
s=s*l;
conj++;
}
if(x>1){
cd*=2;
s*=((x*x)-1)/(x-1);
}
printf("%d %d\n",cd,s);
}
return 0;
}