Pagini recente » Cod sursa (job #1449710) | Cod sursa (job #2423278) | Cod sursa (job #803118) | Cod sursa (job #794195) | Cod sursa (job #1095222)
#include <fstream>
#include <bitset>
#include <cmath>
#define Nmax 1000000
#define X 9973
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int T,P[100000];
bitset < Nmax+99 > v;
long long N,D,S;
void Ciur()
{
P[++P[0]]=2;
for(int i=3;i<=Nmax;i+=2)
if(!v[i])
{
P[++P[0]]=i;
if(1LL*i*i<=Nmax)
for(int j=i*i;j<=Nmax;j+=i)v[j]=1;
}
}
long long Putere(long long N,long long P)
{
long long m=1;
while (P!=1)
if(P % 2==0)N=(N*N) % X,P/=2;
else m=(m*N) % X,--P;
return (m*N)% X;
}
inline void SSND()
{
D=1,S=1;
int sz=sqrt(N+1)+1;
for(int i=1;i<=P[0] && P[i]<=sz && N!=1;++i)
if(N % P[i]==0)
{
int k=0;
while(N % P[i]==0)N/=P[i],++k;
D*=(k+1);
int x1=(Putere(P[i],k+1)-1) % X;
int x2= Putere(P[i]-1,X-2);
S=(( (S*x1) % X ) * x2) % X;
}
if(N>1)
{
D*=2;
S=(S*(N+1) % X);
}
}
int main()
{
Ciur();
f>>T;
for(int i=1;i<=T;++i)f>>N,SSND(),g<<D<<' '<<S<<'\n';
f.close();g.close();
return 0;
}