Pagini recente » Cod sursa (job #2348082) | Cod sursa (job #1586118) | Cod sursa (job #1000753) | Cod sursa (job #1957819) | Cod sursa (job #2114413)
#include <cstdio>
const int MAXN = 1e6;
long long pr[MAXN + 1];
int main() {
int n;
long long ans;
FILE *f = fopen("fractii.in", "r");
fscanf(f, "%d", &n);
fclose(f);
for (int i = 1; i <= n; ++i) {
pr[i] = i;
}
for (int i = 2; i <= n; ++i) {
if (pr[i] == i) {
for (int j = i; j <= n; j += i) {
pr[j] = pr[j] * (i - 1) / i;
}
}
}
ans = 0LL;
for (int i = 1; i <= n; ++i) {
ans += pr[i];
}
f = fopen("fractii.out", "w");
fprintf(f, "%lld\n", 2 * ans - 1);
fclose(f);
return 0;
}