Pagini recente » Cod sursa (job #2015060) | Cod sursa (job #989715) | Monitorul de evaluare | Cod sursa (job #2037089) | Cod sursa (job #1755481)
#include <fstream>
#define maxn 1000010
using namespace std;
long long phi[maxn];
long long n;
void calculatePhi() {
for (long long i = 1; i <= n; i++)
phi[i] = i - 1;
for (long long i = 2; i <= n; i++)
for (long long j = 2 * i; j <= n; j += i)
phi[j] -= phi[i];
}
int main() {
ifstream in("fractii.in");
ofstream out("fractii.out");
in >> n;
calculatePhi();
long long result = 1;
for (long long i = 1; i <= n; i++)
result += 2 * phi[i];
out << result;
return 0;
}