Pagini recente » Cod sursa (job #1605140) | Cod sursa (job #2593783) | Cod sursa (job #2767436) | Cod sursa (job #1262026) | Cod sursa (job #1148652)
# include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n, i;
long long rez = 0;
int EulerTotient(int n){
int phi = n, i;
for (i = 2; i*i <= n; ++i){
if (n%i == 0){
phi /= i;
phi *= (i - 1);
while (n%i == 0)
n /= i;
}
}
if (n > 1){
phi /= n;
phi *= (n - 1);
}
return phi;
}
int main(){
f >> n;
for (i = 1; i <= n; ++i)
rez += EulerTotient(i);
g << 2*rez - 1 << "\n";
g.close(); f.close();
return 0;
}