Cod sursa(job #2101638)
| Utilizator | Data | 7 ianuarie 2018 19:07:19 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int v[1000002],n;
long long sum;
bool neprim[1000002];
int main()
{
fin>>n;
for (int i=2;i<=n;++i)
v[i]=i;
for(int i=2;i<=n;++i)
{
if(!neprim[i])
for(int j=i;j<=n; j+=i)
{
neprim[j]=true;
v[j]-= v[j]/i;
}
sum+=v[i];
}
fout<<2*sum+1<<'\n';
return 0;
}
