Pagini recente » Cod sursa (job #3001409) | Cod sursa (job #1548958) | Cod sursa (job #2672433) | Cod sursa (job #1529027) | Cod sursa (job #2499676)
#include <fstream>
#include <bitset>
#define mod 9973
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
long long n,t,i,nrdiv,sumel,f[1000010],v[1000010],k,j;
int RID(long long n,int exp)
{
long long sol=1;
while(exp>0)
{
if(exp%2==1) sol=(sol*n)%mod;
n=(n*n)%mod;
exp/=2;
}
return sol;
}
void dez(long long d)
{
int nr=0;
while(n%d==0) n/=d,nr++;
if(nr==0) return;
nrdiv*=nr+1;
int val=RID(d,nr+1)-1;
if(val<0) val+=mod;
sumel*=val*RID(d-1,mod-2);
sumel%=mod;
}
int main()
{
for(i=3;i*i<=1000000;i+=2)
if(f[i]==0) for(j=i*3;j<=1000000;j+=i*2) f[j]=1;
v[++k]=2;
for(i=3;i<=1000000;i+=2) if(f[i]==0) v[++k]=i;
fin>>t;
for(;t--;)
{
fin>>n;sumel=1;nrdiv=1;
for(i=1;i<=k&&v[i]*v[i]<=n;i++) if(n%v[i]==0) dez(v[i]);
if(n!=1) dez(n);
fout<<nrdiv<<" "<<sumel<<"\n";
}
return 0;
}