Pagini recente » Cod sursa (job #381337) | Cod sursa (job #2582718) | Cod sursa (job #883123) | Cod sursa (job #637153) | Cod sursa (job #1700499)
/********************
Created by Sburly
********************/
#include <fstream>
using namespace std;
long long int totient[1000001];
long long int sol = 0;
long long int n, i, j;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
f >> n;
for (i = 1; i <= n; ++i)
totient[i] = i-1;
for (i = 2; i <= n; ++i)
{
sol+=totient[i];
for (j = 2*i; j <= n; j += i)
totient[j] -= totient[i];
}
g << (sol<<1)+1;
return 0;
}