Pagini recente » Cod sursa (job #1544947) | Cod sursa (job #373900) | Cod sursa (job #3165533) | Cod sursa (job #2875679) | Cod sursa (job #823223)
Cod sursa(job #823223)
#include <cstdio>
using namespace std;
long c[1000001];
long n,i;
long long s;
void ciur(){
long i,j;
c[0]=0,c[1]=0;
for(i=2;i<=1000001;i++){
c[i]=i;
}
for(i=2;i<=1000001;i++){
if(c[i]==i){
for(j=i;j<=1000001;j+=i){
c[j]=c[j]/i*(i-1);
}
}
}
}
int main() {
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
ciur();
scanf("%d",&n);
for(i=2;i<=n;i++)
s+=c[i]*2;
printf("%lld\n",s+1);
return 0;
}