jcreek/advent-of-code
1
0
Fork 0
mirror of https://github.com/jcreek/advent-of-code.git synced 2026-07-13 03:03:46 +00:00
Code Issues Packages Projects Releases Wiki Activity

chore(*): Move old solutions into a separate folder

Browse Source
This commit is contained in:
Josh Creek
2023-11-30 12:51:45 +00:00
parent ed3eb9cb54
commit b78d79a3af
117 changed files with 141 additions and 141 deletions
Download Patch File Download Diff File Expand all files Collapse all files
old/2021/04/TaskPart2.txt
+8
View File
@@ -0,0 +1,8 @@
--- Part Two ---
On the other hand, it might be wise to try a different strategy: let the giant squid win.
You aren't sure how many bingo boards a giant squid could play at once, so rather than waste time counting its arms, the safe thing to do is to figure out which board will win last and choose that one. That way, no matter which boards it picks, it will win for sure.
In the above example, the second board is the last to win, which happens after 13 is eventually called and its middle column is completely marked. If you were to keep playing until this point, the second board would have a sum of unmarked numbers equal to 148 for a final score of 148 * 13 = 1924.
Figure out which board will win last. Once it wins, what would its final score be?