Cod sursa(job #1377365)
Utilizator | laurentiu pavel laurentt | Data | 5 martie 2015 21:24:39 |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
#include<vector>
using namespace std;
int main() {
ifstream fin ("fractii.in");
ofstream fout("fractii.out");
int N; fin >> N;
vector<int> phi; phi.push_back(0);
for(int i = 1; i <= N; ++i) {
phi.push_back(i-1);
}
for(int i = 2; i <=N; ++i) {
for(int j = i + i; j <= N; j += i) {
phi[j] -= phi[i];
}
}
long long sum = 0;
for(int i = 2; i <= N; ++i) {
sum += phi[i];
}
sum = (sum * 2) + 1;
fout << sum << '\n';
return 0;
}