Cod sursa(job #1834796)
| Utilizator | Data | 25 decembrie 2016 11:29:59 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int a[1000005], n;
long long s = 1;
void Ciur(int n)
{
int i, j;
for(i = 2; i <= n; i++)
a[i] = i - 1;
for(i = 2; i <= n; i++)
for(j = i + i; j <= n; j = i + j)
a[j] = a[j] - a[i];
}
void Rezolva()
{
int i;
Ciur(1000005);
fin >> n;
for(i = 1; i <= n; i++)
s += 2 * a[i];
fout << s << "\n";
}
int main()
{
Rezolva();
fout.close();
return 0;
}
