Pagini recente » Cod sursa (job #1073811) | Cod sursa (job #594882) | Borderou de evaluare (job #2020171) | Cod sursa (job #3188753) | Cod sursa (job #629285)
Cod sursa(job #629285)
#include <stdio.h>
#define N 1000000
char l[N+10];
int pr[79000],i,k=1;
long long j,np=1,m,n1,n2;
short t,d,s;
int main () {
FILE * in=fopen ("ssnd.in","r");
FILE * out=fopen ("ssnd.out","w");
pr[0]=2;
for (i=1; ((i*i)<<1)+(i<<1)<=N; i++) {
if ((l[i>>3]&(1<<(i&7)))==0) {
for (j=((i*i)<<1)+(i<<1); (j<<1)+1<=N; j+=(i<<1)+1) {
l[j>>3]|=(1<<(j&7));
}
}
}
for (i=1; (i<<1)+1<=N; ++i)
if ((l[i>>3] & (1<<(i&7)))==0)
pr[np++]=2*i+1;
//for (i=0; i<np; i++) printf ("%d ",pr[i]);
fscanf (in,"%hd",&t);
for (i=0; i<t; i++) {
fscanf (in,"%lld",&n1);
s=d=1;
for (m=0; pr[m]*pr[m]<=n1; m++) {
j=pr[m];
if (!(n1%j)) {
n2=n1;
k=1;
while (!((n1=n1/j)%j)) k++;
d*=(k+1);
s=s*(n2/n1*j-1)/(j-1)%9973;
}
}
if (n1!=1) {
d+=d;
s=s*(n1*n1-1)/(n1-1)%9973;
}
fprintf (out,"%hd %hd\n",d,s);
}
fclose (in);
fclose (out);
return 0;
}