Cod sursa(job #2231171)
| Utilizator | Data | 13 august 2018 12:55:08 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int Euler[1000001];
int main()
{
int N;
long long sum = 0;
f >> N;
for(int i = 2; i <= N; i++)
Euler[i] = i;
for(int i = 2; i <= N; i++)
{
if(Euler[i] == i)
for(int j = i; j <= N; j += i)
Euler[j] = Euler[i] / i * (i - 1);
sum += Euler[i];
}
g << 2 * sum + 1;
return 0;
}
