Mai intai trebuie sa te autentifici.
Cod sursa(job #1736103)
Utilizator | Data | 1 august 2016 00:46:21 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n, euler[1000001];
int main()
{
fin >> n;
unsigned long long sum = 1; // raportul 1/1
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[j] / i * (i - 1);
for (int i = 2; i <= n; i++)
sum += 2 * euler[i];
fout << sum;
}