Cod sursa(job #1651397)
| Utilizator | Data | 13 martie 2016 11:09:25 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| 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");
#define MAXN 1000050
int N, X[MAXN];
int main()
{
fin >N;
for (int i = 2; i <= N; ++i)
X[i] = i - 1;
long long solution = 0;
for (int i = 2; i <= N; ++i)
{
solution += X[i];
for (int j = i + i; j <= N; j += i)
X[j] -= X[i];
}
solution *= 2;
fout <<solution + 1 <<'\n';
return 0;
}
