Pagini recente » Cod sursa (job #1211545) | Cod sursa (job #79080) | Cod sursa (job #2306566) | Cod sursa (job #1557372) | Cod sursa (job #1812974)
#include <iostream>
#include <cstdio>
using namespace std;
long long int n,p=1;
int a[1000001];
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%lld",&n);
for(int i=1;i<=n;i++)
{
a[i]=i-1;
}
for(int i=2;i<=n;i++)
{
for(int j=i+i;j<=n;j+=i)
a[j]-=a[i];
}
for(int i=1;i<=n;i++)
{
p+=2*a[i];
}
printf("%lld",p);
return 0;
}