Pagini recente » Cod sursa (job #3283616) | Cod sursa (job #3197111) | Cod sursa (job #3261154) | Cod sursa (job #2524582) | Cod sursa (job #3277620)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
int mod=9973;
int power(int base,int power)
{
int res=1;
while(power)
{
if(power%2)
{
res*=base;
res%=mod;
}
base*=base;
base%=mod;
power/=2;
}
return res;
}
int invers(int n)
{
return power(n,mod-2);
}
void tcase()
{
long long n,nr=1,sum=1;
fin>>n;
int d=2;
while(d*d<=n)
{
int exp=0;
while(n%d==0)
{
n/=d;
exp++;
}
nr*=(exp+1);
sum=sum*(power(d,exp+1)-1)%mod*invers(d-1)%mod;
if(d==2)
d++;
else d+=2;
}
if(n!=1)
{
nr*=2;
sum=sum*(n+1);
}
sum%=mod;
fout<<nr<<' '<<sum<<'\n';
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr),cout.tie(nullptr);
int tc;
fin>>tc;
while(tc--)
tcase();
return 0;
}