Cod sursa(job #1122035)
Utilizator | Data | 25 februarie 2014 15:31:09 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.66 kb |
#include <cstdio>
#include <fstream>
using namespace std;
FILE *f=fopen("ssnd.in","r");
FILE *g=fopen("ssnd.out","w");
int8_t c[1000001];
int v[400000],k;
void ciur()
{long long i,j;
c[2]=1;
for (i=3;i<=1000000;i+=2) c[i]=1;
for (i=3;i<=10000;i+=2) if (c[i]==1) for (j=i*i;j<=1000000;j+=i) c[j]=0;
for (i=2;i<=1000000;i++) if (c[i]==1) v[++k]=i;
}
int main()
{ciur();
int n,i,j,t,e,nrdiv;
long long x,sumdiv;
fscanf(f,"%d",&n);
for (j=1;j<=n;j++) {fscanf(f,"%lld",&x);
i=1;e=0;nrdiv=1;sumdiv=1;
while (x!=1) {while (x%v[i]==0) {x/=v[i];
e++;
}
if (e!=0) {nrdiv*=(e+1);
long long y=1;
for (t=0;t<=e;t++) y*=v[i];
sumdiv*=(y-1)/(v[i]-1);
e=0;
}
else if (v[i]*v[i]>x) {nrdiv*=2;
long long y=1;
y=x*x;
sumdiv*=(y-1)/(x-1);
x=1;
}
i++;
}
fprintf(g,"%d %lld\n",nrdiv,sumdiv);
}
return 0;
}