Cod sursa(job #3309248)
| Utilizator | Data | 2 septembrie 2025 21:11:07 | |
|---|---|---|---|
| Problema | Fractii | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int euler(int n)
{
int ans = n;
for (int i = 2; i * i <= n; i++)
{
if (n % i == 0)
{
while (n % i == 0)
{
n = n / i;
}
ans -= ans / i;
}
}
if (n > 1)
{
ans -= ans / n;
}
return ans;
}
int main()
{
int n;
fin >> n;
long long s = 1;
for (int i = 2; i <= n; i++)
{
s = s + 2 * euler(i);
}
fout << s;
return 0;
}