Pagini recente » Cod sursa (job #2868473) | Cod sursa (job #2627912) | Cod sursa (job #2782420) | Cod sursa (job #2777554) | Cod sursa (job #700830)
Cod sursa(job #700830)
#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++;
}
}
long put(long x,long y)
{
long nr=1,i;
for(i=1;i<=y;i++)
nr=nr*x%9973;
return 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*=((put(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==1) nrdiv=2,suma=(nr+1)%9973;
printf("%ld %ld\n",nrdiv,suma);
}
return 0;
}