Pagini recente » Cod sursa (job #2500383) | Cod sursa (job #1358552) | Cod sursa (job #3184461) | Cod sursa (job #1402375) | Cod sursa (job #3219108)
#include <fstream>
using namespace std;
int n, i, j;
const int NMAX = 1e6 + 1;
long long T = 0;
int fi[NMAX];
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main()
{
fin >> n;
for (i = 1; i < NMAX; i++)
fi[i] = i;
for (int i = 2; i < NMAX; ++i)
{
if (fi[i] == i)
for (int j = i; j <= n; j += i)
fi[j] = fi[j] / i * (i - 1);
}
for (i = 1; i <= n; ++i)
T += fi[i];
fout << 2 * T - 1;
return 0;
}