this post was submitted on 02 Dec 2024
43 points (97.8% liked)

Advent Of Code

1086 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 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

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 2 years ago
MODERATORS
 

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

(page 2) 7 comments
sorted by: hot top controversial new old
[โ€“] TunaCowboy@lemmy.world 1 points 7 months ago* (last edited 7 months ago)

python

solution

import re
import aoc

def setup():
    return (aoc.get_lines(2), 0)

def safe(data):
    order = 0 if data[0] < data[1] else 1
    for i in range(0, len(data) - 1):
        h = data[i]
        t = data[i + 1]
        d = abs(h - t)
        if d not in [1, 2, 3] or (order == 0 and h >= t) or (
                order == 1 and h <= t):
            return False
    return True

def one():
    lines, acc = setup()
    for l in lines:
        if safe([int(x) for x in re.findall(r'\d+', l)]):
            acc += 1
    print(acc)

def two():
    lines, acc = setup()
    for l in lines:
        data = [int(x) for x in re.findall(r'\d+', l)]
        for i in range(len(data)):
            if safe(data[:i] + data[i + 1:]):
                acc += 1
                break
    print(acc)

one()
two()

[โ€“] Reptorian@programming.dev 1 points 7 months ago* (last edited 7 months ago)

G'MIC solution

spoiler

it day2
crop. 0,0,0,{h#-1-2}
split. -,{_'\n'}
foreach { replace_str. " ",";" ({t}) rm.. }

safe_0,safe_1=0
foreach {
	({h}) a[-2,-1] y
	num_of_attempts:=da_size(#-1)+1
	store temp

	repeat $num_of_attempts {

		$temp

		if $> eval da_remove(#-1,$>-1) fi

		eval "
			safe=1;
			i[#-1,1]>i[#-1,0]?(
				for(p=1,p<da_size(#-1),++p,
					if(!inrange(i[#-1,p]-i[#-1,p-1],1,3,1,1),safe=0;break(););
				);
			):(
				for(p=1,p<da_size(#-1),++p,
					if(!inrange(i[#-1,p-1]-i[#-1,p],1,3,1,1),safe=0;break(););
				);
			);
			safe;"

		rm

		if $>
			if ${} safe_1+=1 break fi
		else
			if ${} safe_0,safe_1+=1 break fi
		fi

	}

}

echo Day" "2:" "${safe_0}" :: "${safe_1}

[โ€“] antlion@lemmy.dbzer0.com 1 points 7 months ago

R (R-Wasm)

input = file('input2024day2.txt',open='r')
lines = readLines(input)
library(stringr)
safe = 0
safe2 = 0
for (ln in lines){
  vals = as.numeric(unlist(str_split(ln,' ')))
  diffs = diff(vals)
  cond1 = min(diffs) > 0 || max(diffs) < 0
  cond2 = max(abs(diffs)) < 4
  if (cond1 && cond2){
    safe = safe + 1
  }
  else { #Problem Dampener
    dampen = FALSE
    for (omit in -1:-length(vals)){
      diffs = diff(vals[omit])
      cond1 = min(diffs) > 0 || max(diffs) < 0
      cond2 = max(abs(diffs)) < 4
      if (cond1 && cond2){
        dampen = TRUE
      }
    }
    if (dampen){
      safe2 = safe2 + 1}
  }
}
print (safe) #Part 1
print (safe + safe2) #Part 2
load more comments
view more: โ€น prev next โ€บ