Pagini recente » Cod sursa (job #1067157) | Cod sursa (job #305021) | Cod sursa (job #49828) | Statistici Motatu Maria (motatu_maria) | Cod sursa (job #1162619)
#include <iostream>
#include <fstream>
#define vmax 1000000
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
bool ok[1000005];
int p[100005],np,mod=9973;
void Ciur()
{ int i,j;
np=1; p[np]=2;
for(i=3;i<=vmax;i+=2)
{
if (!ok[i])
{ np++; p[np]=i;
for(j=3*i;j<=vmax;j+=2*i)
ok[j]=1;
}
}
}
void Solve(long long x)
{ int i,pw;
long long sact,sdiv,nrdiv,val;
nrdiv=1; sdiv=1;
for(i=1;p[i]*p[i]<=x && i<=np;i++)
{ pw=0; sact=1; val=p[i];
while(x%p[i]==0)
{
pw++;
sact+=val;
val=(val*p[i])%mod;
x/=p[i];
}
nrdiv=(nrdiv*(pw+1))%mod; sdiv=(sdiv*sact)%mod;
}
if (x>1) {nrdiv=(nrdiv*2)%mod; sdiv=(sdiv*(x+1))%mod;}
g<<nrdiv<<" "<<sdiv<<"\n";
}
int main()
{ int i,t; long long nr;
Ciur();
f>>t;
for(;t;t--)
{ f>>nr;
Solve(nr);
}
return 0;
}