Day 2: Red-Nosed Reports
Megathread guidelines
- Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
- You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://blocks.programming.dev if you prefer sending it through a URL
FAQ
- What is this?: Here is a post with a large amount of details: https://programming.dev/post/22323136
- Where do I participate?: https://adventofcode.com/
- Is there a leaderboard for the community?: We have a programming.dev leaderboard with the info on how to join in this post: https://programming.dev/post/6631465
Uiua
Took me a bit longer to get this one but still quite simple overall.
Spent quite some time on getting to know the
tryandassertoperators better.Run with example input here
# Get the indices matching the ascending/ # descending criteria CheckAsc ← ≡°□⍚(⍣(⊸⍤.≍⍆.)⍣(⊸⍤.≍⇌⍆.)0) # Get the indices matching the distance criteria CheckDist ← ≡°□⍚(⍣(⊸⍤.≠1∈:0)0×⊓≥≤1,3⌵⧈-) Split ← ⊙(▽≠1)▽,, PartOne ← ( &rs ∞ &fo "input-2.txt" ⊜(□⊜⋕≠@ .)≠@\n. CheckAsc. ▽ CheckDist ⧻⊚ ) PartTwo ← ( &rs ∞ &fo "input-2.txt" ⊜(□⊜⋕≠@ .)≠@\n. CheckAsc. Split CheckDist. Split ⊙(⊂) ⧻ : ⍚(≡(▽:°⊟)⍜¤⊞⊟:≠1⊞=.⇡⧻.) ≡(⧻⊚CheckDist▽CheckAsc.°□) +⧻◴⊚ ) &p "Day 2:" &pf "Part 1: " &p PartOne &pf "Part 2: " &p PartTwo