Pagini recente » Cod sursa (job #129079) | Istoria paginii utilizator/[email protected] | Cod sursa (job #3333652) | Borderou de evaluare (job #1418723) | Cod sursa (job #3327331)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main() {
int v[1000001], n;
while (fin >> n) {
for (int i = 1; i <= n; i++) {
v[i] = i;
}
for (int i = 2; i <= n; i++) {
if (v[i] == i) {
v[i]--;
for (int j = i * 2; j <= n; j += i) {
v[j] = v[j] / i * (i - 1);
}
}
}
long long int ans = 1;
for (int i = 2; i <= n; i++) {
ans = ans + 2 * v[i];
}
fout << ans << " ";
}
return 0;
}