Pagini recente » Cod sursa (job #2548698) | Cod sursa (job #2279696) | Cod sursa (job #3120680) | Cod sursa (job #1140091) | Cod sursa (job #2272507)
#include <iostream>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
const int VM=1e6+1;
int e[VM];
void euler(int n){
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;
in>>n;
long long s=1;
euler(n);
for(int i=1;i<=n;i++)
s=s+2*e[i];
out<<s;
return 0;
}