Cod sursa(job #2134256)
| Utilizator | Data | 17 februarie 2018 19:41:32 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
long long int phi[1000001];
long long int sol = 1;
ifstream fi("fractii.in");
ofstream fo("fractii.out");
void indicator(long long int n)
{
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];
sol += 2 * phi[i];
}
}
int main()
{
long long int n;
fi >> n;
indicator(n);
fo << sol;
return 0;
}