Cod sursa(job #2047139)
| Utilizator | Data | 24 octombrie 2017 16:42:39 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int N=1000001;
int v[N];
void Euler()
{
for(int i=1;i<=N;i++)v[i]=i;
for(int i=2;i<=N;i++)
{
if(v[i]==i)for(int j=i;j<=N;j+=i)v[j]/=i,v[j]*=(i-1);
}
}
int main()
{
Euler();
long long S=0;
int n;
fin>>n;
for(int i=2;i<=n;i++)S+=v[i];
fout<<S*2+1;
return 0;
}
