Cod sursa(job #3273081)
| Utilizator | Data | 1 februarie 2025 09:42:25 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | cex_8 | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
long long n,p,q,nr;
const int Max=1e6;
long long a[Max + 1];
void euler(){
for(int i=1;i<=Max ; i ++)
a[i]=i;
for(int i=2;i<=Max;i ++)
if(a[i]==i)
{
a[i]--;
for(int j=2;j*i<=Max ; j ++)
a[j*i]=a[j*i]/i*(i-1);
}
}
int main()
{cin >> n;
euler();
for(int i=1;i<=n;i++)
nr+=a[i];
cout << nr*2-1;
return 0;
}
