Pagini recente » Istoria paginii utilizator/incrediblefitness | Cod sursa (job #836675) | Profil ionatan00 | Atasamentele paginii Clasament infos0ft_2019 | Cod sursa (job #1755484)
#include <fstream>
#define maxn 1000010
using namespace std;
long long phi[maxn];
int n;
void calculatePhi() {
for (int i = 1; i <= n; i++)
phi[i] = i;
for (int i = 2; i <= n; i++)
if (phi[i] == i)
for (int j = i; j <= n; j += i) {
phi[j] /= i;
phi[j] *= (i - 1);
}
}
int main() {
ifstream in("fractii.in");
ofstream out("fractii.out");
in >> n;
calculatePhi();
long long result = 1;
for (int i = 1; i <= n; i++)
result += 2LL * phi[i];
out << result;
return 0;
}