Pagini recente » Borderou de evaluare (job #2593670) | Cod sursa (job #797635) | Cod sursa (job #3148621) | Cod sursa (job #1622023) | Cod sursa (job #2221472)
# pragma GCC optimize("O3")
# include <bits/stdc++.h>
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
//# define int ll
using namespace std;
int n,f[1 << 20],b[1 << 20];
ll ans;
int32_t main(){_
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
cin >> n;
for(int i = 1;i <= n;i++) f[i] = i;
for(int i = 2;i <= n;i++)
{
for(int j = 2 * i;j <= n;j += i)
{
b[j] = 1;
if(!b[i])
{
f[j] = f[j] - f[j] / i;
}
}
if(!b[i]) f[i]--;
}
for(int i = 2;i <= n;i++) ans += f[i];
ans *= 2;
ans++;
rc(ans);
}