Cod sursa(job #708802)
Utilizator | Data | 7 martie 2012 11:01:03 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <stdio.h>
long a[1000002],i,j,n;
long long k;
FILE *f,*g;
int main()
{
f=fopen("fractii.in","r");
g=fopen("fractii.out","w");
fscanf(f,"%ld",&n);
k=2;
for(i=2;i<=n;i++){a[i]=i;}
for(i=2;i<=n;i++){
if(a[i]==i){for(j=i;j<=n;j+=i){a[j]/=i;a[j]*=(i-1);}}
k+=2*a[i];
}
k--;
fprintf(g,"%lld",k);
return 0;
}