Pagini recente » Cod sursa (job #2464746) | Cod sursa (job #1493312) | Cod sursa (job #422318) | Cod sursa (job #1335815) | Cod sursa (job #823631)
Cod sursa(job #823631)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("fractii.in");
ofstream out ("fractii.out");
long long phi[1000100];
int main ()
{
int N, i, j;
long long sol = 1;
in >> N;
for (i = 2; 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] = (long long) (i - 1) / i * phi[i];
for (i = 2; i <= N; i ++)
sol += (long long) phi[i] << 1;
out << sol;
return 0;
}