diff options
| author | Louis Burda <quent.burda@gmail.com> | 2023-04-08 12:40:30 -0400 |
|---|---|---|
| committer | Louis Burda <quent.burda@gmail.com> | 2023-04-09 10:21:36 -0400 |
| commit | 9282e95e8844afe856ba76ceb6d2c3010df8bb1a (patch) | |
| tree | e35affc89b20324371381e079f7cb5f8a06aa81b /src/03/part2 | |
| parent | 2b5d4232879dc74491dabf54a0ddc958d66ebcec (diff) | |
| download | aoc2020-zig-master.tar.gz aoc2020-zig-master.zip | |
Diffstat (limited to 'src/03/part2')
| -rw-r--r-- | src/03/part2 | 18 |
1 files changed, 18 insertions, 0 deletions
diff --git a/src/03/part2 b/src/03/part2 new file mode 100644 index 0000000..715fd1a --- /dev/null +++ b/src/03/part2 @@ -0,0 +1,18 @@ +--- Part Two --- + +Time to check the rest of the slopes - you need to minimize the probability of a sudden arboreal +stop, after all. + +Determine the number of trees you would encounter if, for each of the following slopes, you start at +the top-left corner and traverse the map all the way to the bottom: + +- Right 1, down 1. - Right 3, down 1. (This is the slope you already checked.) - Right 5, down 1. - +Right 7, down 1. - Right 1, down 2. + +In the above example, these slopes would find 2, 7, 3, 4, and 2 tree(s) respectively; multiplied +together, these produce the answer [1m[37m336[0m. + +[1m[37mWhat do you get if you multiply together the number of trees encountered on each of the +listed slopes?[0m + + |
