Pagini recente » Cod sursa (job #627013) | Borderou de evaluare (job #688889) | Cod sursa (job #862410) | Cod sursa (job #1939685) | Cod sursa (job #480380)
Cod sursa(job #480380)
#include<cstdio>
#include<fstream>
using namespace std;
#define nn 999984
#define nm 78499
#define mod 9973
int c[nn],v[nm];
int nrp,t;
long long n;
int ridica (int baz,int exp)
{
baz%=mod;
int b[50],nrb=0;
for(;exp;exp/=2)
b[++nrb]=exp%2;
int rez=1;
for(;nrb;--nrb){
rez=(rez*rez)%mod;
if(b[nrb])
rez=(rez*baz)%mod;
}
return rez;
}
int main ()
{
for(int i=2;i<nn;++i)
if(c[i]==0){
v[++nrp]=i;
for(int j=2*i;j<nn;j+=i)
c[j]=1;
}
ifstream in ("ssnd.in");
freopen("ssnd.out","w",stdout);
for(in>>t;t;--t){
in>>n;
int i=1,s=1,nrd=1;
while(n>1){
int p=0;
while(n%v[i]==0){
++p;
n/=v[i];
}
s=(s*(ridica(v[i],p+1)-1)/(v[i]-1))%mod;
nrd*=(p+1);
++i;
if(v[i]*v[i]>n&&v[i]&&n%v[i]!=0){
nrd<<1;
s=((s*n*n)%mod);
n=1;
}
}
printf("%d %d\n",nrd,s);
}
in.close();
return 0;}