Cod sursa(job #648706)
| Utilizator | Data | 14 decembrie 2011 00:21:50 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <stdio.h>
int a[1000000];
long long calculare(int n,int a[1000000]){
long long nr=0;
int i,j;
for (i=2;i<=n;i++)
a[i]=i-1;
for (i=2;i<=n;i++){
for (j=2*i;j<=n;j+=i)
a[j]-=a[i];
nr+=a[i];
}
return 2*nr+1;
}
int main()
{
FILE* f=fopen("fractii.in","r");
FILE* g=fopen("fractii.out", "w");
int result,n;
result=fscanf(f,"%d", &n);
fprintf(g,"%lld",calculare(n,a));
fclose(f);
fclose(g);
return 0;
}