Cod sursa(job #2978494)
| Utilizator | Data | 13 februarie 2023 20:14:02 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("fractii.in");
ofstream fout("fractii.out");
int main()
{
int n; fin >> n;
long long ciur[n + 1];
for (int i = 1; i <= n; i ++)
ciur[i] = i;
for (int i = 2; i <= n; i ++)
if (ciur[i] == i)
for (int j = i; j <= n; j += i)
ciur[j] = ciur[j] * (i - 1) / i;
long long nr = 1;
for (int i = 2; i <= n; i ++)
nr += 2 * ciur[i];
fout << nr;
fin.close();
fout.close();
return 0;
}
