Advent Of Code

982 readers

78 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 2024

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. [2024 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

[email protected]

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

submitted 1 year ago* (last edited 1 year ago) by [email protected] to c/[email protected]

38 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

[–] [email protected] 2 points 1 year ago (1 children)

Golang

Pretty straightforward. The only optimization I did is that the pairs are symmetric (3ms hold and 4ms travel is the same as 4ms hold and 3ms travel).

Part 1

file, _ := os.Open("input.txt")
defer file.Close()
scanner := bufio.NewScanner(file)

scanner.Scan()
times := strings.Fields(strings.Split(scanner.Text(), ":")[1])
scanner.Scan()
distances := strings.Fields(strings.Split(scanner.Text(), ":")[1])
n := len(times)
countProduct := 1

for i := 0; i &lt; n; i++ {
	t, _ := strconv.Atoi(times[i])
	d, _ := strconv.Atoi(distances[i])
	count := 0
	for j := 0; j &lt;= t/2; j++ {
		if j*(t-j) > d {
			if t%2 == 0 &amp;&amp; j == t/2 {
				count++
			} else {
				count += 2
			}
		}
	}

	countProduct *= count
}

fmt.Println(countProduct)

Part 2

file, _ := os.Open("input.txt")
defer file.Close()
scanner := bufio.NewScanner(file)

scanner.Scan()
time := strings.ReplaceAll(strings.Split(scanner.Text(), ":")[1], " ", "")
scanner.Scan()
distance := strings.ReplaceAll(strings.Split(scanner.Text(), ":")[1], " ", "")

t, _ := strconv.Atoi(time)
d, _ := strconv.Atoi(distance)
count := 0

for j := 0; j &lt;= t/2; j++ {
	if j*(t-j) > d {
		if t%2 == 0 &amp;&amp; j == t/2 {
			count++
		} else {
			count += 2
		}
	}
}

fmt.Println(count)

[–] [email protected] 2 points 1 year ago

ah damn, didn't think of the symmetric pairs