Cod sursa(job #3219107)
| Utilizator | Data | 30 martie 2024 08:09:15 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
using namespace std;
int n, i, j;
const int NMAX = 1e6 + 1;
long long T = 0;
int fi[NMAX];
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main()
{
fin >> n;
for (i = 1; i <= n; i++)
fi[i] = i;
for (int i = 2; i <= n; ++i)
{
if (fi[i] == i)
for (int j = i; j <= n; j += i)
fi[j] = fi[j] / i * (i - 1);
}
for (i = 1; i <= n; ++i)
T += fi[i];
fout << 2 * T - 1;
return 0;
}