Pagini recente » Cod sursa (job #783808) | Cod sursa (job #1783466) | Cod sursa (job #2578124) | Cod sursa (job #862078) | Cod sursa (job #2582918)
#include <bits/stdc++.h>
#define MAX 131072
#define MOD 666013
#define INF 2100000000
#define fx first
#define fy second
using namespace std;
const int NMAX = 1000010;
double prim[NMAX], x, N;
long long ans;
int main(){
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
cin >> N;
for(int i = 2; i <= N; i++)
prim[i] = i;
for(int i = 2; i <= N; i++)
if(prim[i] == i){
prim[i]--;
x = i;
for(int j = 2 * i; j <= N; j += i)
prim[j] *= 1 - 1 / x;
}
for(int i = 1; i <= N; i++)
ans += prim[i];
printf("%lld", 2 * ans + 1);
return 0;
}