Cod sursa(job #1661512)
| Utilizator | Data | 23 martie 2016 22:16:16 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <cstdio>
#include <fstream>
#include<algorithm>
#include<vector>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int N;
int v[1000010];
int main() {
long long r = 0;
in >> N;
for (int i = 2;i <= N;++i)
v[i] = i - 1;
for (int i = 2;i <= N;++i)
{
r += 2 * v[i];
for (int j = i + i;j <= N;j += i)
{
v[j] -= v[i];
}
}
out << r+1;
return 0;
}