-
Notifications
You must be signed in to change notification settings - Fork 9
/
Copy pathday_09a.cpp
49 lines (45 loc) · 1.22 KB
/
day_09a.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include <algorithm>
#include <fstream>
#include <iostream>
#include <queue>
#include <vector>
constexpr int n_preamble = 25;
int main() {
std::ifstream file{"../input/day_09_input"};
int number;
std::vector<int> preamble_v;
std::queue<int> preamble_q;
preamble_v.reserve(n_preamble);
// Create preamble
while (n_preamble > preamble_v.size() && file >> number) {
preamble_v.push_back(number);
preamble_q.push(number);
}
while (file >> number) {
int begin = 0;
int end = preamble_v.size() - 1;
std::sort(std::begin(preamble_v), std::end(preamble_v));
bool found = false;
while (begin < end) {
const int sum = preamble_v[begin] + preamble_v[end];
if (sum == number && preamble_v[begin] != preamble_v[end]) {
const auto element_to_remove = preamble_q.front();
preamble_q.pop();
preamble_q.push(number);
*std::find(std::begin(preamble_v), std::end(preamble_v),
element_to_remove) = number;
found = true;
break;
} else if (sum > number) {
end--;
} else if (sum < number) {
begin++;
}
}
if (!found) {
std::cout << number << '\n';
return number;
}
}
return -1;
}