Advent Of Code

764 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

Follow the programming.dev instance rules
Keep all content related to advent of code in some way
If what youre posting relates to a day, put in brackets the year and then day number in front of the post title (e.g. [2023 Day 10])
When an event is running, keep solutions in the solution megathread to avoid the community getting spammed with posts

Relevant Communities

Relevant Links

Advent of Code Homepage

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

Ategon@programming.dev

Sigmatics@lemmy.ca

CameronDev@programming.dev

🌟 - 2023 DAY 6 SOLUTIONS -🌟 (programming.dev)

submitted 11 months ago* (last edited 11 months ago) by Ategon@programming.dev to c/advent_of_code@programming.dev

37 comments fedilink hide all child comments

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

What is this?: Here is a post with a large amount of details: https://programming.dev/post/6637268
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

you are viewing a single comment's thread
view the rest of the comments

[–] morrowind@lemmy.ml 2 points 11 months ago

Crystal

# part 1
times = input[0][5..].split.map &amp;.to_i
dists = input[1][9..].split.map &amp;.to_i

prod = 1
times.each_with_index do |time, i|
	start, last = find_poss(time, dists[i])
	prod *= last - start + 1
end
puts prod

# part 2
time = input[0][5..].chars.reject!(' ').join.to_i64
dist = input[1][9..].chars.reject!(' ').join.to_i64

start, last = find_poss(time, dist)
puts last - start + 1

def find_poss(time, dist)
	start = 0
	last  = 0
	(1...time).each do |acc_time|
		if (time-acc_time)*acc_time > dist
			start = acc_time
			break
	end     end
	(1...time).reverse_each do |acc_time|
		if (time-acc_time)*acc_time > dist
			last = acc_time
			break
	end     end
	{start, last}
end