Cod sursa(job #2333726)
| Utilizator | Data | 1 februarie 2019 21:16:41 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
const int NMAX=1e6+5;
int N;
int Euler[NMAX];
inline void Indicator (int N)
{
for(int i=1; i<=N; ++i)
Euler[i]=i-1;
for(int i=2; i*i<=N; ++i)
if(Euler[i] == i-1)
for(int j=2; j*i<=N; ++j)
--Euler[i*j];
}
long long ans=0;
int main()
{
f.tie(NULL);
f>>N;
Indicator(N);
for(int i=1; i<=N; ++i)
ans+=1LL*Euler[i];
ans=ans*1LL*2;
++ans;
g<<ans<<'\n';
return 0;
}
