Cod sursa(job #2999570)
| Utilizator | Data | 11 martie 2023 10:35:10 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
#define ll long long
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,x;
const int N=1e6;
ll a[N+5];
int main()
{
f>>n;
for(int i=1;i<=N;i++)
a[i]=i;
for(int i=2;i<=N;i++)
if(a[i]==i)
{
a[i]--;
for(int j=i*2;j<=N;j+=i)
a[j]=a[j]/i*(i-1);
}
for(int i=1;i<=n;i++)
a[i]+=a[i-1];
g<<a[n]*2-1<<'\n';
return 0;
}
