Pagini recente » Cod sursa (job #2319136) | Cod sursa (job #2319100) | Cod sursa (job #578355) | Cod sursa (job #1588826) | Cod sursa (job #1315442)
#include<fstream>
using namespace std;
int a[1000009],np;
long long p[80001],c,d,i,j,z,nrd;
long long pow (long long b,int e)
{
long long p,x;
p=1;
x=b;
while(e>0)
{
if(e%2==1)
{
p=p*x;
}
x=x*x;
e=e/2;
}
return p;
}
int t,s;
int main()
{
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
np=0;
for(i=2;i<=1000000;i++)
{
if(a[i]==0)
{
np++;
p[np]=i;
for(j=i*i;j<1000000;j=j+i)
{
a[j]=1;
}
}
}
fin>>t;
for(i=1;i<=t;i++)
{
fin>>z;
j=1;
nrd=1;
s=1;
while(p[j]*p[j]<=z)
{
c=0;
while(z%p[j]==0)
{
c++;
z=z/p[j];
}
d=pow(p[j],c);
nrd=nrd*(1+c);
s=(s*(d*p[j]-1)/(p[j]-1))%9973;
j++;
}
if(z>1)
{
nrd=nrd*2;
s=(s*(z+1))%9973;
}
fout<<nrd<<" "<<s<<"\n";
}
return 0;
}