Pagini recente » Cod sursa (job #2049316) | Cod sursa (job #1620289) | Cod sursa (job #663109) | Cod sursa (job #714233) | Cod sursa (job #1652205)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
const int Pmax = 1e8;
int phi[Pmax+10];
int i,j;
void bagaphi(int n) {
for (i = 1; i <= n; ++i)
phi[i] = i;
for (i = 2; i <= n; ++i)
if (phi[i] == i)
for (j = i; j <= n; j += i) phi[j] = phi[j] / i * (i - 1);
}
int main() {
int n;
in >> n;
long long s = 0;
bagaphi(n);
for(int i = 1; i <= n; i++)
s += phi[i];
out << s*2-1;
return 0;
}