Pagini recente » Cod sursa (job #2637986) | Cod sursa (job #320313) | Cod sursa (job #2300401) | Cod sursa (job #262315) | Cod sursa (job #2587369)
#include <iostream>
#include <fstream>
using namespace std;
bool v[1000001];
int b[100000];
int main()
{
ifstream cin("ssnd.in");
ofstream cout("ssnd.out");
for(int i=2; i<=100000; i++)
if(v[i]!=1)
for(int j=2*i; j<=1000000; j+=i)
v[j]=1;
int k=0;
for(int i=2; i<=1000000; i++)
if(v[i]!=1)
b[++k]=i;
int t;
cin>>t;
for(int i=1; i<=t; i++)
{
int n;
cin>>n;
int div=1,l=0;
long long sum =1,s=1;
for(int i=1; b[i]*b[i]<=n; i++)
if(n%b[i]==0)
{
while(n%b[i]==0)
{
l++;
n=n/b[i];
s=s*b[i];
}
s*=b[i];
s-=1;
s/=(b[i]-1);
sum*=s;
div*=(l+1);
}
if(n>1)
{
div*=2;
sum*=(n+1);
}
cout<<div<<" "<<sum%9973<<"\n";
}
return 0;
}