aoc-2021-rust

Advent of Code 2021 Solutions in Rust
git clone https://git.sinitax.com/sinitax/aoc-2021-rust
Log | Files | Refs | README | sfeed.txt

part2 (800B)


      1--- Part Two ---
      2
      3On the other hand, it might be wise to try a different strategy: let the giant squid win.
      4
      5You aren't sure how many bingo boards a giant squid could play at once, so rather than waste time
      6counting its arms, the safe thing to do is to figure out which board will win last and
      7choose that one. That way, no matter which boards it picks, it will win for sure.
      8
      9In the above example, the second board is the last to win, which happens after 13 is eventually
     10called and its middle column is completely marked. If you were to keep playing until this point, the
     11second board would have a sum of unmarked numbers equal to 148 for a final score of 148 * 13 =
     121924.
     13
     14Figure out which board will win last. Once it wins, what would its final score be?
     15
     16