Pagini recente » Cod sursa (job #1040704) | Cod sursa (job #225621) | Cod sursa (job #2947429) | Cod sursa (job #2640575) | Cod sursa (job #416875)
Cod sursa(job #416875)
#include <stdio.h>
#include <math.h>
#define nmax 1000000
using namespace std;
int n;
long long nrt, phi[nmax];
void citire ()
{
scanf("%d",&n);
}
void solve ()
{
for (int i = 1; i <= n; ++i)
phi[i] = i-1;
for (int i = 2; i <= n; ++i)
for (int j = 2*i; j <= n; j += i)
phi[j] -= phi[i];
}
int main ()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
citire ();
solve ();
nrt = 1;
for (int i = 2; i <= n; i++)
nrt += phi[i] *2;
printf("%d",nrt);
}