aboutsummaryrefslogtreecommitdiff
path: root/src/2019/day7/aoc.cpp
diff options
context:
space:
mode:
authorkaiwu <kaiwu2004@gmail.com>2022-04-19 22:45:20 +0800
committerkaiwu <kaiwu2004@gmail.com>2022-04-19 22:45:20 +0800
commitad940fa52f8bc45f07b5678eee4d94ee662e769b (patch)
tree38cb5bb6414ebed16832398fe8ac7d061d2f8af4 /src/2019/day7/aoc.cpp
parent7da1f98aaad6260d68ca0a819f0f7c5388b47a4d (diff)
downloadadvent-of-code-ad940fa52f8bc45f07b5678eee4d94ee662e769b.tar.gz
advent-of-code-ad940fa52f8bc45f07b5678eee4d94ee662e769b.zip
2018 2019 day7 part1
Diffstat (limited to 'src/2019/day7/aoc.cpp')
-rw-r--r--src/2019/day7/aoc.cpp1
1 files changed, 1 insertions, 0 deletions
diff --git a/src/2019/day7/aoc.cpp b/src/2019/day7/aoc.cpp
index c1a8ba5..176683a 100644
--- a/src/2019/day7/aoc.cpp
+++ b/src/2019/day7/aoc.cpp
@@ -8,6 +8,7 @@ void find_max(int* is, int i, std::set<int>& ns, int* max, const std::vector<int
if (i == 10) {
set_computer(&is[i - 2]);
int n = run_computer(codes);
+ // printf("%d %d %d %d %d -> %d\n", is[0], is[2], is[4], is[6], is[8], n);
if (n > *max) {
*max = n;
}