Pagini recente » Cod sursa (job #2060339) | Cod sursa (job #833221) | Cod sursa (job #3357917) | Cod sursa (job #3327462) | Cod sursa (job #800631)
Cod sursa(job #800631)
#include <stdio.h>
long v[1000001];
int main() {
freopen("functii.in", "r", stdin);
freopen("functii.out", "w", stdout);
long n;
scanf("%ld", &n);
long i, j;
for (i = 2; i< n+1; i++)
v[i] = i;
long result = 1;
for (i = 2; i < n+1; i++){
if (v[i] == i) { // daca e prim
for (j = i; j < n+1; j+=i) {
v[j] /= i;
v[j] *= (i-1);
}
}
result += (2 * v[i]);
}
printf("%ld", result);
return 0;
}