Pagini recente » Cod sursa (job #452111) | Cod sursa (job #500894) | Cod sursa (job #1172481) | Cod sursa (job #2257055) | Cod sursa (job #1194881)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream input("fractii.in");
ofstream output("fractii.out");
int n = 0;
int sieve[n+1];
input >> n;
for (int i = 0; i <= n+1; i++) {
sieve[i] = 1;
}
for (int i = 2; i <= n; i++) {
for (int j = 2; j * i <= n; j++) {
sieve[j*i] = 0;
}
}
int phi[n+1];
for (int i = 2; i <= n; i++) {
phi[i] = i;
for (int j = 2; j <= i; j++) {
if (sieve[j] == 1 && i % j == 0) {
phi[i] = phi[i] * (j - 1) / j;
}
}
}
int sum = 0;
for (int i = 2; i <= n; i++) {
sum += phi[i];
}
output << sum * 2 + 1 << endl;
return 0;
}