Pagini recente » Cod sursa (job #405585) | Cod sursa (job #1301845) | Cod sursa (job #2683900) | Cod sursa (job #583555) | Cod sursa (job #1011189)
#include <stdio.h>
#include <math.h>
#define N 1000001
#define ll long long
#define fr(i,a,b) for(int i=a;i<b;++i)
int a[N];
int main(){
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
int n;
scanf("%i",&n);
int sqrtn=sqrt(n);
a[1]=1;
fr(i,2,sqrtn+1){
if(!a[i]) for(int j=i;j<=n;j+=i) a[j]=i;
}
fr(i,2,n+1){
if(a[i]==i||!a[i]) a[i]=i-1;
else{
int p=a[i];
if((i/p)%p==0) a[i]=a[i/p]*p;
else a[i]=a[i/p]*(p-1);
}
}
ll s=0;
fr(i,1,n+1) s+=a[i];
s=s<<1;
s-=1;
printf("%lli\n",s);
return 0;
}