Pagini recente » Cod sursa (job #1572720) | Cod sursa (job #2365864) | Cod sursa (job #2207006) | Monitorul de evaluare | Cod sursa (job #1471143)
#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxN 10000002
using namespace std;
long long sol;
int n, i, j, v[maxN];
void read()
{
freopen("fractii.in", "r", stdin);
scanf("%d", &n);
v[1] = 1;
sol = 1;
}
void solve()
{
for (i = 2; i <= n; ++ i)
v[i] = i - 1;
for (i = 2; i <= n; ++ i)
{
sol = (long long)(2 * v[i] * 1LL + sol);
for (j = i * 2; j <= n; j += i)
v[j] -= v[i];
}
}
void write()
{
freopen("fractii.out", "w", stdout);
printf("%lld", sol);
}
int main()
{
read();
solve();
write();
return 0;
}