Pagini recente » Cod sursa (job #2682232) | Cod sursa (job #496463) | Cod sursa (job #3040948) | Cod sursa (job #1188879) | Cod sursa (job #635024)
Cod sursa(job #635024)
#include <fstream>
using namespace std;
const int MOD = 9973;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
int N=1000005, cnt=0;
//char prim[1000005];
int p[1000005];
int i, j, i2;
const int NMAX = 1 << 17;
unsigned char V[NMAX];
int main()
{
long long n,t,i,j,nr,s,fact,e,f,m;
p[++cnt]=2;
for (i = 3; i <= N; i += 2) {
if (V[i >> 4] & (1 << ((i >> 1) & 7))) continue;
p[++cnt]=i;
for (j = i + (i2 = i + i); j <= N; j += i2)
V[j >> 4] |= 1 << ((j >> 1) & 7);
}
fin>>t;
for(i=1;i<=t;i++)
{
fin>>n;m=n;
f=1; nr=1;s=1;
while(n!=1&&f<=N)
{
if(n%p[f]==0)
{
e=0;fact=p[f];
while(n%p[f]==0)
{
n=n/p[f];
e++;
fact=(fact*(p[f]));
}
s=s*(fact-1)/(p[f]-1);
s=s%MOD;
nr=nr*(e+1);
}
f++;
}
if(n!=1)
{
nr=nr*2;
s=(s*(n+1));
s=s%MOD;
}
fout<<nr<<" "<<s%MOD<<"\n";
}
}