Pagini recente » Cod sursa (job #133539) | Cod sursa (job #236809) | Cod sursa (job #1196744) | Cod sursa (job #1719341) | Cod sursa (job #1812934)
#include<bits/stdc++.h>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int t,c;
long long n,s,nrd,y;
bitset<1000002>v;
long long p[500005],np;
int main()
{
f>>t;
np=0;
for(long long j=2;j<=1000001;j++)
if(v[j]==0)
{
for(long long k=2;k*j<=1000000;k++)
v[k*j]=1;
np++;
p[np]=j;
}
for(int i=1;i<=t;i++)
{
f>>n;
s=1;
nrd=1;
for(long long 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';
}
return 0;
}