Cod sursa(job #92286)
Utilizator | Data | 14 octombrie 2007 20:43:13 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <stdio.h>
#include <math.h>
#define MAX_N 1024 * 1024
long n;
long A[MAX_N];
int main() {
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
scanf("%ld", &n);
long i, j;
long long sum = 0;
// ciur:
for (i = 1; 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] = A[j] / i * (i - 1);
}
}
}
for (i = 1; i <= n; ++i)
sum = sum + A[i];
printf("%lld\n", sum * 2 - 1);
return 0;
}