Pagini recente » Cod sursa (job #719000) | Cod sursa (job #488822) | Cod sursa (job #525234) | Cod sursa (job #3158888) | Cod sursa (job #582907)
Cod sursa(job #582907)
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
long long p,s,n,s1,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;
}
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); p=1; for(k=1;k<=fm+1;k++) p*=j;
s*=(p-1)/(j-1);
j++;
}while(nr!=1);
}g<<n<<" "<<s%9973<<'\n';}
return 0;
}