Cod sursa(job #582897)
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
long long p,s,n,s1;
int k;
int prim(long long nu)
{int ok,d;
ok=1;
for(d=2;d<=sqrt(nu);d++)
if(nu%d==0) ok=0;
return ok;
}
long long suma(int baza,int expo)
{s1=1;
do
{s1+=baza*--expo;}while(expo!=0);
return s1;
}
int main()
{int i,t,j,fm,nr;
f>>t;
for(i=1;i<=t;i++)
{f>>nr; n=s=1; if(prim(nr)) {n*=2; s*=++nr; } else {j=2;
do
{fm=0;
while(nr%j==0) {fm++; nr/=j;} n*=(fm+1); s*=suma(j,(fm+1));
j++;
}while(nr!=1);
}g<<n<<" "<<s%9973<<'\n';}
return 0;
}