Files
aoc2025/day01/Notes.md
Nic 42167714ef Solution for Day 1
(easy but inefficient algorithm for part 2)
2025-12-01 18:39:27 +01:00

291 B

Day 1: Notes

  • values range from 0 to 99
  • current value starts at 50
  • modulo 100: [99] + [1] = [0]
  • two rotation operations:
    • L: rotate left (subtract)
    • R: rorate right (add)
    • both followed by amount
  • count if current value equals 0

Format: lines of [L|R][0-9]{1,3}