Pagini recente » Cod sursa (job #1959692) | Cod sursa (job #2483699) | Cod sursa (job #1675284) | Borderou de evaluare (job #2022011) | Cod sursa (job #2825075)
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int n;
const int nmax=1e6;
int phi[nmax+5];
static void prec_phi(){
for(int i=1;i<=nmax;++i)phi[i]=i;
for(int i=2;i<=nmax;++i){
if(phi[i]==i){
--phi[i];
for(int j=2*i;j<=nmax;j+=i)
phi[j]=(phi[j]/i)*(i-1);
}
}
}
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
prec_phi();
scanf("%d ",&n);
ll ans=0;
for(int i=2;i<=n;++i)
ans+=phi[i];
printf("%lld ",2*ans+1);
}