Pagini recente » Cod sursa (job #364115) | Cod sursa (job #43704) | Cod sursa (job #1453775) | Cod sursa (job #1503955) | Cod sursa (job #1517321)
#include <stdio.h>
#define lim 1000001
#define MOD 9973
unsigned short int v[100500];
char ciur[lim];
long long p,nr,x,y,val;
int verif(int div,int n){
long long put=0;
val=1;
while(n%div==0){
put++;
val=(long long)val*div;
n/=div;
}
val*=div;
p=(p*(val-1)/(div-1))%MOD;
nr=nr*(put+1);
val/=div;
return n;
}
int main(){
FILE *fin,*fout;
fin=fopen("ssnd.in","r");
fout=fopen("ssnd.out","w");
int i,j,n;
for(i=2;i*i<lim;i++)
if(ciur[i]==0)
for(j=i*i;j<lim;j+=i)
ciur[j]=1;
j=0;
for(i=2;i<=lim;i++)
if(ciur[i]==0){
j++;
v[j]=i;
}
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++){
fscanf(fin,"%lld",&x);
p=1;
nr=1;
y=x;
j=1;
while(v[j]*v[j]<=x){
y=verif(v[j],y);
j++;
}
if(y>1)
y=verif(y,y);
if(p==1){
p=p+x;
nr=2;
}
fprintf(fout,"%lld %lld\n",nr,p);
}
fclose(fin);
fclose(fout);
return 0;
}