Pagini recente » Istoria paginii runda/id123321 | Cod sursa (job #1100786) | Cod sursa (job #1508591) | Cod sursa (job #461327) | Cod sursa (job #989419)
Cod sursa(job #989419)
#include <iostream>
#include <fstream>
using namespace std;
#define Nmax 1000005
long long ciur[Nmax];
unsigned N;
void gen()
{
for ( int i = 2; i < Nmax; ++i )
ciur[i] = i - 1;
for ( int i = 2; i < Nmax; ++i )
for ( int j = 2*i; j < Nmax; j += i )
ciur[j] -= ciur[i];
for ( int i = 1; i < Nmax; ++i )
ciur[i] += ciur[i - 1];
}
void solve()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
f >> N;
g << 1LL * 2 * ciur[N] + 1 << "\n";
f.close();
g.close();
}
int main()
{
gen();
solve();
return 0;
}