Pagini recente » Cod sursa (job #2037576) | Cod sursa (job #735138) | Borderou de evaluare (job #731974) | Cod sursa (job #732032) | Cod sursa (job #1812976)
#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;
}