Pagini recente » Cod sursa (job #2887721) | Cod sursa (job #2114405) | Cod sursa (job #1498180) | Cod sursa (job #2040170) | Cod sursa (job #2437776)
#include <iostream>
#include <cstring>
#include <algorithm>
#include <fstream>
#include <cmath>
#include <limits.h>
#include <iomanip>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int indicatorEuler(int n) {
int euler = 1, auxn = n;
int d = 2, p;
while (n > 1) {
p = 0;
while (n % d == 0) {
++p;
n /= d;
}
if (p)
euler = euler * (d - 1) * pow(d, p - 1);
if (d == 2)
d++;
else
d += 2;
if (n > 1 && d * d > n)
d = n;
}
return euler;
}
void Rezolvare() {
int n, numarFractii = 0;
fin >> n;
for (int i = 2; i <= n; i++)
numarFractii = numarFractii + 2 * indicatorEuler(i);
fout << numarFractii + 1 << " ";
}
int main() {
Rezolvare();
return 0;
}