Cod sursa(job #2293820)
| Utilizator | Data | 1 decembrie 2018 16:55:12 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | c-32 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <stdio.h>
int n, i, j;
long long s;
FILE *f, *g;
int main()
{
f = fopen("fractii.in", "r");
g = fopen("fractii.out", "w");
fscanf(f, "%d", &n);
int v[n];
for(i = 1; i <= n; i++)
v[i] = i - 1;
for(i = 2; i <= n; i++) //ciurul lui eratostene
for(j = 2 * i; j <= n; j += i)
v[j] -= v[i];
for(i = 2; i <= n; i++)
s += v[i];
fprintf(g, "%lld", 2*s+1);
fclose(f); fclose(g);
return 0;
}
