Pagini recente » Cod sursa (job #1302066) | Cod sursa (job #2337386) | Cod sursa (job #593198) | Cod sursa (job #3289413) | Cod sursa (job #1806629)
#include <fstream>
using namespace std;
long long n,t,i,c,s,nrd,y,j,k,np,p[500005];
char v[1000002];
int main()
{
ifstream f("ssnd.in");
ofstream g("ssnd.out");
f>>t;
np=0;
for(j=2; j<=1000001; j++)
{
if(v[j]==0)
{
for(k=2; k*j<=1000000; k++)
{
v[k*j]=1;
}
np++;
p[np]=j;
}
}
for(i=1; i<=t; i++)
{
f>>n;
s=1;
nrd=1;
for(j=1; p[j]*p[j]<=n; j++)
{
if(n%p[j]==0)
{
c=0;
y=1;
while(n%p[j]==0)
{
c++;
n=n/p[j];
y=y*p[j];
}
nrd=nrd*(c+1);
s=s*((y*p[j]-1)/(p[j]-1))%9973;
}
}
if(n>1)
{
nrd=nrd*2;
s=s*(n+1)%9973;
}
g<<nrd<<" "<<s<<'\n';
}
f.close(); g.close();
return 0;
}