Cod sursa(job #2272503)
Utilizator | Data | 30 octombrie 2018 11:05:00 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
using namespace std;
const int VM=1e6+1;
int e[VM];
void euler(){
for(int i=2;i<VM;i++)
e[i]=i;
for(int i=2;i<VM;i++){
if(e[i]==i){
for(int j=i;j<VM;j+=i){
e[j]=e[j]/i*(i-1);
}
}
}
}
int main()
{
int n;
cin>>n;
long long s=1;
euler();
for(int i=1;i<=n;i++)
s=s+2*e[i];
cout<<s;
return 0;
}