Pagini recente » Cod sursa (job #1204274) | Cod sursa (job #344911) | Cod sursa (job #747566) | Cod sursa (job #2142761) | Cod sursa (job #2414499)
#include <cstdio>
using namespace std;
const int NMAX = 1000005;
int phi[NMAX];
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
int n;
scanf("%d",&n);
for(int i = 2 ; i <= n ; i++)
phi[i] = i-1;
for(int i = 2 ; i <= n/2 ; i++)
for(int j = 2 * i ; j <= n ; j += i)
phi[j] -= phi[i];
int ans = 0;
for(int i = 2 ; i <= n ; i++)
ans = ans + phi[i];
printf("%d\n",(ans<<1)+1);
return 0;
}