complete part 8 (switched to bitmasks).
This commit is contained in:
@@ -71,8 +71,6 @@ Because the digits 1, 4, 7, and 8 each use a unique number of segments, you shou
|
||||
In the output values, how many times do digits 1, 4, 7, or 8 appear?
|
||||
|
||||
Your puzzle answer was 543.
|
||||
|
||||
The first half of this puzzle is complete! It provides one gold star: *
|
||||
--- Part Two ---
|
||||
|
||||
Through a little deduction, you should now be able to determine the remaining digits. Consider again the first example above:
|
||||
@@ -128,3 +126,7 @@ Following this same process for each entry in the second, larger example above,
|
||||
Adding all of the output values in this larger example produces 61229.
|
||||
|
||||
For each entry, determine all of the wire/segment connections and decode the four-digit output values. What do you get if you add up all of the output values?
|
||||
|
||||
Your puzzle answer was 994266.
|
||||
|
||||
Both parts of this puzzle are complete! They provide two gold stars: **
|
||||
|
Reference in New Issue
Block a user