Pagini recente » Cod sursa (job #1155481) | Cod sursa (job #1298458) | Cod sursa (job #2880355) | Cod sursa (job #2283111) | Cod sursa (job #1745126)
#include<fstream>
#include<math.h>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
int t,i,v[1000005],nrp,modulo=9973,m,k,d,v1,v2;
long long nrd,n,p,sum,prime[1000005];
void erat(){
long long i,k,j;
for (i=4;i<=1000000;i+=2)
v[i]=1;
nrp++;
prime[nrp]=2;
for (i=3;i<=1000000;i+=2)
if (v[i]==0){
nrp++;
prime[nrp]=i;
for (j=i*i;j<=1000000;j+=2*i)
v[j]=1;
}
}
int main(){
erat();
fin>>t;
for (i=1;i<=t;i++){
fin>>n;
nrd=1;sum=1;
for(k=1;k<=nrp && prime[k]*prime[k]<=n;k++){
if (n%prime[k]==0){
d=0;p=prime[k];
while(n%prime[k]==0){
n=n/prime[k];
d++;
p=p*prime[k];
}
nrd*=(d+1);
sum*=((p-1)/(prime[k]-1))%modulo;
}
}
if (n>1){
nrd=nrd*2;
sum*=(n+1)%modulo;
}
fout<<nrd<<" "<<sum%modulo<<'\n';
}
fin.close();
fin.close();
return 0;
}