Cod sursa(job #2194583)
Utilizator | Data | 13 aprilie 2018 19:45:20 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int MAX = 1e6+1;
int n,v[MAX];
void euler()
{
int i;
for(i=1;i<=n;i++)
v[i]=i;
for(i=2;i<=n;i++)
if(v[i]==i)
for(int j=i;j<=n;j+=i)
v[j]=v[j]/i*(i-1);
}
int main()
{
cin>>n;
euler();
long long a=-1;
for(int i=1;i<=n;i++)
a=a+2*v[i];
cout<<a;
return 0;
}