Cod sursa(job #2194811)
Utilizator | Data | 14 aprilie 2018 13:31:09 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <iostream>
using namespace std;
const int MAX=1e6+3;
int n,fi[MAX];
void euler()
{
for(int i=1; i<=n; i++)
fi[i]=i;
for(int i=2; i<=n; i++)
if(fi[i]==i)
for(int j=i; j<=n; j+i)
fi[j]=fi[j]/i*(i-1);
}
int main()
{
cin>>n;
euler();
long long ans=-1;
for(int i=1; i<=n; i++)
ans=ans+2*fi[i];
cout<<ans;
return 0;
}