Pagini recente » Cod sursa (job #701881) | Cod sursa (job #119257) | Cod sursa (job #2160125) | Cod sursa (job #261897) | Cod sursa (job #1392209)
#include<fstream>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
long long n,t,nrd,sd,x,i,d,c,y,j,k,m=0;
char ciur[1000009];
int prime[100009];
int main()
{
ciur[1]=1;
for(k=2;k<=1000000;k++)
{
if(ciur[k]==0)
{
m++;
prime[m]=k;
for(j=k*k;j<=1000000;j=j+k)
{
ciur[j]=1;
}
}
}
fin>>t;
for(j=1;j<=t;j++)
{
fin>>n;
nrd=1;
sd=1;
x=n;
i=1;
d=prime[1];
while(d*d<=x)
{
c=0; y=1;
while(x%d==0)
{
c++; y=y*d;
x=x/d;
}
if(c!=0)
{
nrd=nrd*(1+c);
sd=(sd*(y*d-1)/(d-1)%9973)%9973;
}
i++;
d=prime[i];
}
if(x!=1)
{
nrd=nrd*2;
sd=(sd*(x+1))%9973;
}
fout<<nrd<<" "<<sd<<"\n";
}
fout.close();
fin.close();
return 0;
}