Cod sursa(job #326656)
| Utilizator | Data | 25 iunie 2009 18:54:11 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <stdio.h>
long phi[1000001],i,n;
long long j;
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%ld\n",&n);
for (i=1; i<=n; ++i) phi[i]=i;
for (i=2; i<=n; ++i)
if (phi[i]==i)
for (j=i; j<=n; j+=i) phi[j]-=phi[j]/i;
j=1;
for (i=2; i<=n; ++i) j+=phi[i]<<1;
printf("%lld\n",j);
fclose(stdin); fclose(stdout);
return 0;
}
