Cod sursa(job #1755480)
| Utilizator | Data | 10 septembrie 2016 12:39:57 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
#define maxn 1000010
using namespace std;
int phi[maxn];
int n;
void calculatePhi() {
for (int i = 1; i <= n; i++)
phi[i] = i - 1;
for (int i = 2; i <= n; i++)
for (int j = 2 * i; j <= n; j += i)
phi[j] -= phi[i];
}
int main() {
ifstream in("fractii.in");
ofstream out("fractii.out");
in >> n;
calculatePhi();
int result = 1;
for (int i = 1; i <= n; i++)
result += 2 * phi[i];
out << result;
return 0;
}