Cod sursa(job #2109224)
Utilizator | Data | 19 ianuarie 2018 12:29:36 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.38 kb |
#include <fstream>
using namespace std;
long long i,j,t,n,p,u[100000];
long long x,y,nr,d,s,X,z;
bool v[1000100];
int main()
{
ifstream f("ssnd.in");
ofstream g("ssnd.out");
for(j=4;j<=1000000;j=j+2)
v[j]=1;
for(i=3;i*i<=1000000;i=i+2)
if(v[i]==0)
for(j=i*i;j<=1000000;j=j+2*i)
v[j]=1;
v[0]=1;v[1]=1;
u[++t]=2;
for(i=3;i<=1000000;i=i+2)
if(v[i]==0)
u[++t]=i;
f>>n;
for(i=1;i<=n;i=i+1)
{
f>>x;s=1;nr=1;X=x;
for(d=1;u[d]*u[d]<=x;d=d+1)
{
if(x%u[d]==0)
{
p=0;y=1;
while(X%u[d]==0)
{
p++;
X=X/u[d];
}
nr=nr*(p+1);
p++;z=u[d];
while(p)
{
if(p%2==1)
{
p--;
y=y*z;
}
z=z*z;
p=p/2;
}
y=y-1;
s=s*y;
s=s/(u[d]-1);
s=s%9973;
}
}
if(X!=1)
{
nr=nr*2;
y=X*X;
y=y-1;
s=s*y;
s=s/(X-1);
s=s%9973;
}
g<<nr<<' '<<s<<'\n';
}
return 0;
}