Pagini recente » Cod sursa (job #2866438) | Cod sursa (job #1608768) | Cod sursa (job #1316957) | Cod sursa (job #1928121) | Cod sursa (job #2907387)
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n, phi[1000005];
long long int s = 1LL;
int main() {
fin >> n;
fin.close();
for(int i = 1; i <= n; i++) {
phi[i] = i;
}
for(int i = 2; i <= n; i++) {
if(phi[i] == i) {
phi[i]--;
for(int j = 2; i * j <= n; j++) {
phi[i * j] = phi[i * j] / i * (i - 1);
}
}
s += 2LL * phi[i];
}
fout << s;
return 0;
}