Pagini recente » Cod sursa (job #45593) | Cod sursa (job #2926971) | Cod sursa (job #27919) | Cod sursa (job #232204) | Cod sursa (job #1107827)
#include <cstdio>
using namespace std;
#define MAX 10000001
int v[MAX], n;
void euler()
{
int i, j;
for(i=1; i<MAX; i++) v[i] = i;
for(i=2; i<MAX; i++)
if(v[i]==i)
for(j=i; j<MAX; j+=i)
v[j] -= v[j]/i;
}
void afis(int x)
{
int i;
for(i=1; i<=x; i++)
printf("%d ", v[i]);
}
int main()
{
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
int i;
long long rez = 0;
scanf("%d", &n);
euler();
for(i=2; i<=n; i++)
rez += v[i];
rez = rez*2 + 1;
printf("%lld", rez);
return 0;
}