-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
66 lines (60 loc) · 1.83 KB
/
main.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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include "file.h"
#include <iostream>
#include <vector>
#include <set>
namespace aoc2017_day06 {
int part_1(std::string_view path) {
std::vector<int> input = file::readFileAsArrayInt(path);
std::set<std::vector<int>> states;
while (states.insert(input).second) {
auto it = std::max_element(input.begin(), input.end());
int max = *it;
*it = 0;
for (int i = 0; i < max; ++i) {
it++;
if (it == input.end()) {
it = input.begin();
}
(*it)++;
}
}
return states.size();
}
int part_2(std::string_view path) {
std::vector<int> input = file::readFileAsArrayInt(path);
std::set<std::vector<int>> states;
while (states.insert(input).second) {
auto it = std::max_element(input.begin(), input.end());
int max = *it;
*it = 0;
for (int i = 0; i < max; ++i) {
it++;
if (it == input.end()) {
it = input.begin();
}
(*it)++;
}
}
std::set<std::vector<int>> loop;
while (loop.insert(input).second) {
auto it = std::max_element(input.begin(), input.end());
int max = *it;
*it = 0;
for (int i = 0; i < max; ++i) {
it++;
if (it == input.end()) {
it = input.begin();
}
(*it)++;
}
}
return loop.size();
}
}
#ifndef TESTING
int main() {
std::cout << "Part 1: " << aoc2017_day06::part_1("../2017/day06/input.in") << std::endl;
std::cout << "Part 2: " << aoc2017_day06::part_2("../2017/day06/input.in") << std::endl;
return 0;
}
#endif