Pagini recente » Cod sursa (job #1234178) | Cod sursa (job #273489) | Cod sursa (job #1987595) | Cod sursa (job #2850488) | Cod sursa (job #1670050)
#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long unsigned
int phi[1000005];
int main() {
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
ll ans = 1;
int i,j,n;
scanf("%d",&n);
for(i = 2;i <= n;i++){
phi[i] = i;
}
for(i = 2;i <= n;i++){
if(phi[i] == i){
for(j = i;j <= n;j += i){
phi[j] /= i;
phi[j] *= i-1;
}
}
ans += 2*phi[i];
}
printf("%llu\n",ans);
return 0;
}