Pagini recente » Cod sursa (job #596373) | Borderou de evaluare (job #1332868) | Borderou de evaluare (job #1713721) | Cod sursa (job #980044) | Cod sursa (job #1504152)
#include <cstdio>
#define MAX 1000005
long v[MAX];
int main(void){
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
long n,sol=0,i,j;
scanf("%d",&n);
for(i=1;i<=n;++i) v[i]=i;
for(i=2;i<=n;++i)
if(v[i]==i)
for(j=i;j<=n;j+=i) { v[j]=v[j]/i; v[j]=v[j]*(i-1);}
for(i=2;i<=n;++i) sol+=2*v[i];
printf("%d",sol+1);
//
return 0;
}