Pagini recente » Cod sursa (job #2390047) | Cod sursa (job #1493157) | Cod sursa (job #130696) | Cod sursa (job #53500) | Cod sursa (job #809158)
Cod sursa(job #809158)
#include<fstream>
#define LMAX 1000002
using namespace std;
unsigned long euler(unsigned long length){
unsigned long phi[LMAX],i,j,sum = 0;
for(i = 1; i <= length; i++){
phi[i] = i;
}
for(i = 2; i <= length; i++){
if(phi[i] == i){
for(j = i; j <= length; j+=i){
phi[j] /= i;
phi[j] *= (i-1);
}
}
}
for(i = 1; i <= length; i++){
sum += phi[i];
}
return sum;
}
int main(){
unsigned long n;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>n;
if(n == 0) fout << "0\n";
else fout << euler(n)*2-1<<"\n";
fin.close();
fout.close();
return 0;
}