Pagini recente » Cod sursa (job #1322708) | Cod sursa (job #1017906) | Cod sursa (job #2470320) | Cod sursa (job #1254868) | Cod sursa (job #1857211)
#include <stdio.h>
#define Nmax 1000000
int phi[Nmax+1], N, i, j;
long long sum;
main(){
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
scanf("%d", &N);
for(i=1; i<=Nmax; i++){
phi[i] = i-1;
}
for(i=2; i<=Nmax; i++){
for(j=2*i; j<=Nmax; j+=i){
phi[j] -= phi[i];
}
}phi[0] = phi[1] = 1;
for(i=1; i<=N; i++){
sum += phi[i];
}sum *= 2; sum--;
printf("%lld", sum);
return 0;
}