Pagini recente » Cod sursa (job #27574) | Cod sursa (job #700356) | Borderou de evaluare (job #1159789) | Cod sursa (job #187342) | Cod sursa (job #692890)
Cod sursa(job #692890)
#include <stdio.h>
int main () {
long long int n,j,k,i,p[1000000];
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%Ld ",&n);
k=0;
for (i=1;i<=n;i++) p[i]=i;
for (i=2;i<=n;i++)
if (p[i]==i)
for (j=i;j<=n;j+=i) {p[j] /=i;
p[j]*=(i-1);}
for (i=1;i<=n;i++)
k=k+p[i];
printf("%Ld \n",k*2 -1);
return 0;
}