Cod sursa(job #2416110)
Utilizator | Data | 26 aprilie 2019 21:52:31 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long n, m, i, j, ans;
int prime[1000001];
int main()
{
f >> n;
// indicatorul Euler
for(i = 2; i <= n; i ++)
prime[i] = i - 1;
for(i = 2; i <= n; i ++)
{
ans += prime[i];
for(j = i * 2; j <= n; j += i)
prime[j] = prime[j] - prime[i];
}
g << 2 * ans + 1;
f.close();
g.close();
return 0;
}