Pagini recente » Cod sursa (job #3164860) | Cod sursa (job #355419) | Cod sursa (job #1173033) | Cod sursa (job #106649) | Cod sursa (job #1808452)
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int n,nd,e,m,t,i,j,p[1000000];
long long sd,s,k;
int main()
{
p[1]=2;m=1;
for(i=3;i<=1000;i+=2)
if(!p[i])
{
m++;
p[m]=i;
for(j=i*i;j<=1000000;j+=2*i)
p[j]=1;
}
for(i=1001;i<=1000000;i+=2)
if(!p[i])
p[++m]=1;
f>>t;
for(;t;t--)
{
f>>n;
nd=1;
sd=1;
for(i=1;i<=m;i++)
{
if(1ll*p[i]*p[i]>n)
break;
if(n%p[i]==0)
{
e=1;k=1;s=1;
while(n%p[i]==0)
{
e++;
k*=p[i];
s+=k;
n/=p[i];
}
nd*=e;
sd=(sd*s)%9973;
}
}
if(n>1)
{
nd*=2;
sd=(sd*(n+1))%9973;
}
g<<nd<<" "<<sd<<'\n';
}
return 0;
}