Pagini recente » Cod sursa (job #707365) | Cod sursa (job #313000) | Cod sursa (job #3282194) | Cod sursa (job #2710900) | Cod sursa (job #3182819)
/**
* Author: Andu Scheusan (not_andu)
* Created: 09.12.2023 17:45:56
*/
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define INFILE "fractii.in"
#define OUTFILE "fractii.out"
typedef long long ll;
const int PHI_MAX = 10000000;
ll phi[PHI_MAX + 5];
void init_phi(){
for(int i = 1; i <= PHI_MAX; ++i) phi[i] = i - 1;
for(int i = 2; i <= PHI_MAX; ++i){
for(int j = 2 * i; j <= PHI_MAX; j += i){
phi[j] -= phi[i];
}
}
}
void solve(){
init_phi();
int n; cin >> n;
ll ans = 0;
for(int i = 1; i <= n; ++i){
ans += phi[i];
}
cout << 2 * ans + 1 << '\n';
}
int main(){
ios_base::sync_with_stdio(false);
freopen(INFILE, "r", stdin);
freopen(OUTFILE, "w", stdout);
cin.tie(nullptr);
cout.tie(nullptr);
solve();
return 0;
}