Pagini recente » Cod sursa (job #3194664) | Cod sursa (job #143839) | Cod sursa (job #3211136) | Cod sursa (job #848111) | Cod sursa (job #620568)
Cod sursa(job #620568)
#include <fstream>
using namespace std;
const int NMAX = 1000005;
const int MOD = 9973;
int prime[NMAX];
bool viz[NMAX];
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
void ciur()
{
int i, j;
viz[0]=1;
viz[1]=1;
for (i=2; i<NMAX; i++)
{
if (!viz[i])
{
prime[++prime[0]]=i;
for (j=i+i; j<NMAX; j+=i)
viz[j]=1;
}//if
}//for i
}//ciur
int main()
{
long long n, p, t, d, sd, q, i;
ciur();
fin>>t;
while (t--)
{
fin>>n;
i=1;
d=1;
sd=1;/////
for (i=1; prime[i]*prime[i]<=n; i++)
if (n%prime[i]==0)
{
for (p=0, q=prime[i]; n%prime[i]==0; n/=prime[i], p++, q*=prime[i]);
d*=p+1;
sd=sd*(q-1)/(prime[i]-1)%MOD;////
}//if
if (n>1)
{
d*=2;
sd = (sd*(n+1) % MOD);
}//if
fout<<d<<" "<<sd<<"\n";
}
return 0;
}