Cod sursa(job #2587999)
Utilizator | Covei Denis cdenis | Data | 24 martie 2020 00:49:14 |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int MAX=1000005;
int n,v[MAX],m,i,j,d,eul;
long long cnt;
int main()
{
fin >> n;
for(i=1;i<=n;i++)
v[i]=i;
for(i=2;i<=n;i++)
if(v[i]==i)
for(j=i;j<=n;j+=i)
v[j]=v[j]/i*(i-1);
for(i=1;i<=n;i++)
cnt+=1LL*v[i];
fout << 2LL*cnt-1LL;
return 0;
}