this post was submitted on 06 Dec 2023
22 points (95.8% liked)

Advent Of Code

158 readers
1 users here now

An unofficial home for the advent of code community on programming.dev!

Advent of Code is an annual Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.

AoC 2023

Solution Threads

M T W T F S S
1 2 3
4 5 6 7 8 9 10
11 12 13 14 15 16 17
18 19 20 21 22 23 24
25

Rules/Guidelines

Relevant Communities

Relevant Links

Credits

Icon base by Lorc under CC BY 3.0 with modifications to add a gradient

console.log('Hello World')

founded 1 year ago
MODERATORS
 

Day 6: Wait for It


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)
  • Code block support is not fully rolled out yet but likely will be in the middle of the event. Try to share solutions as both code blocks and using something such as https://topaz.github.io/paste/ , pastebin, or github (code blocks to future proof it for when 0.19 comes out and since code blocks currently function in some apps and some instances as well if they are running a 0.19 beta)

FAQ

you are viewing a single comment's thread
view the rest of the comments
[โ€“] mykl 4 points 11 months ago* (last edited 11 months ago)

Dart Solution

I decided to use the quadratic formula to solve part 1 which slowed me down while I struggled to remember how it went, but meant that part 2 was a one line change.

This year really is a roller coaster...

int countGoodDistances(int time, int targetDistance) {
  var det = sqrt(time * time - 4 * targetDistance);
  return (((time + det) / 2).ceil() - 1) -
      (max(((time - det) / 2).floor(), 0) + 1) +
      1;
}

solve(List> data, [param]) {
  var distances = data.first
      .indices()
      .map((ix) => countGoodDistances(data[0][ix], data[1][ix]));
  return distances.reduce((s, t) => s * t);
}

getNums(l) => l.split(RegExp(r'\s+')).skip(1);

part1(List lines) =>
    solve([for (var l in lines) getNums(l).map(int.parse).toList()]);

part2(List lines) => solve([
      for (var l in lines) [int.parse(getNums(l).join(''))]
    ]);