Cod sursa(job #2230387)
Utilizator | Data | 9 august 2018 22:17:04 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int N;
int Euler[1000001];
long long int Sol;
int main()
{
f >> N;
for(int i = 2; i <= N; i++)
Euler[i] = i - 1;
for(int i = 2; i <= N; i++)
{
Sol += Euler[i];
for(int j = 2 * i; j <= N; j += i)
Euler[j] -= Euler[i];
}
g << 2 * Sol + 1;
return 0;
}