Pagini recente » Cod sursa (job #1336537) | Cod sursa (job #1154822) | Cod sursa (job #3239906) | Cod sursa (job #779497) | Cod sursa (job #700740)
Cod sursa(job #700740)
#include<stdio.h>
#include <math.h>
long nr,i,t,suma,nrdiv,a[100001],b[100001];
void ciur(long x)
{
long nr=2,nrp,pr=0;
while(nr<=x)
{
if(a[nr]==0)
{
nrp=nr+nr;
while (nrp<x)
{
a[nrp]=1;
nrp+=nr;
}
pr++;
b[pr]=nr;
}
nr++;
}
}
void prob(long nr)
{
nrdiv=1,suma=1;
long max=int(sqrt(nr)),i;
for(i=1;i<=max;i++)
{
long p=0;
while (nr%b[i]==0)
{
p++;
nr/=b[i];
}
nrdiv*=(p+1);
suma*=(int(pow(b[i],p+1)-1))/(b[i]-1)%9973;
}
}
int main()
{
freopen("ssnd.in","r",stdin);
freopen("ssnd.out","w",stdout);
scanf("%ld",&t);
ciur(100000);
for(i=1;i<=t;i++)
{
scanf("%ld",&nr);
prob(nr);
if(nrdiv==1)
{
suma=nr+1;
nrdiv=2;
}
printf("%ld %ld\n",nrdiv,suma);
}
return 0;
}