Cod sursa(job #280677)
| Utilizator | Data | 13 martie 2009 15:17:57 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <stdio.h>
bool sir[1000000];
int t[100000];
int main ()
{
long nrfractii, n, i, j, q;
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
scanf("%d", &n);
nrfractii=1;
t[1]=1;
for(i=2;i<=n;i++)
{
if(sir[i]==0)
{
t[i]=i-1;
for(j=i*i; j<=n; j*=i)
{
t[j]=t[j/i]*i;
}
for(j=i*2; j<=n; j+=i)
{
sir[j]=1;
for(q=i; q<=n && j%q==0; q*=i)
if(!t[j] && (j/i)%q!=0)
t[j]=t[q]*t[j/q];
}
}
nrfractii+=2*t[i];
}
printf("%d", nrfractii);
return 0;
}
