Cod sursa(job #2013566)
| Utilizator | Data | 21 august 2017 19:04:21 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | c | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <stdlib.h>
#include <stdio.h>
long long int p, n, b[1000000], i, j, k;
int main(){
freopen( "fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
scanf("%li", &n);
for (i = 2; i <= n; i++){
b[i] = i;
}
for (i = 2; i <= n; i++){
if (b[i] == i){
b[i] = i - 1;
for (j = 2 * i; j <= n; j = i + j){
b[j] = b[j] - b[j] / i;
}
}
}
p = 3;
for (i = 3; i <= n; i++){
p = p + 2 * b[i];
}
printf("%li", p);
return 0;
}
