ajet/advent-of-code
1
0
Fork 0
mirror of https://github.com/Ajetski/advent-of-code.git synced 2025-11-27 11:02:45 -10:00
Code Issues Packages Projects Releases Wiki Activity

init day17 part 1

Browse Source
This commit is contained in:
Adam Jeniski 2025-10-27 16:50:32 -04:00
parent eb2ca945da
commit 4418b4da78
4 changed files with 90 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
2024/.gitignore vendored
View File

@ -1,2 +1,3 @@
input/
.lein-repl-history
*.iml

4
2024/bb.edn
View File

@ -1,4 +0,0 @@
{:deps {org.clojure/clojure {:mvn/version "1.12.0"}
org.clojure/math.combinatorics {:mvn/version "0.3.0"}}
:paths ["src" "../shared/clj/src"]
:tasks {}}

3
2024/project.clj
View File

@ -8,5 +8,6 @@
[org.clojure/data.priority-map "1.2.0"]
[org.clojure/math.combinatorics "0.3.0"]
[babashka/fs "0.5.23"]
[org.babashka/http-client "0.4.22"]]
[org.babashka/http-client "0.4.22"]
[org.clojure/core.match "1.1.0"]]
:source-paths ["src" "../shared/clj/src"])

100
2024/src/day17.clj
View File

@ -4,19 +4,93 @@
[clojure.string :as str]))
(let [[registers _ [program]]
(->> (input-manager/get-input 2024 17)
(->> #_(input-manager/get-input 2024 17)
"Register A: 729\nRegister B: 0\nRegister C: 0\n\nProgram: 0,1,5,4,3,0"
(str/split-lines)
(partition-by (partial = "")))]
(def registers (update-vals
(into {}
(map (comp vec
rest
first
(partial re-seq #"(\w)+: (.*)")) registers))
parse-long))
(def program (map parse-long
(-> program
(str/split #" ")
second
(str/split #",")))))
(into {}
(map (comp vec
rest
first
(partial re-seq #"(\w)+: (.*)")) registers))
parse-long))
(def program (mapv parse-long
(-> program
(str/split #" ")
second
(str/split #",")))))
[registers program]
(defn combo-op->value [combo-op registers]
(condp = combo-op
4 (registers "A")
5 (registers "B")
6 (registers "C")
7 (throw (ex-message "invalid"))
combo-op))
(defn compute
([registers program]
(compute registers program 0 []))
([{A "A", B "B", C "C" :as registers} program instr-ptr out]
(if (>= instr-ptr (count program))
[out registers]
(let [operation (program instr-ptr)
operand (program (inc instr-ptr))
combo-operand (delay (combo-op->value operand registers))
instr-ptr' (+ 2 instr-ptr)]
(condp = operation
0 (recur (->> (int (/ A (max 1 (bit-shift-left 2 (dec @combo-operand)))))
(assoc registers "A"))
program instr-ptr' out)
1 (recur (->> operand
(bit-xor B)
(assoc registers "B"))
program instr-ptr' out)
2 (recur (->> (mod @combo-operand 8)
(assoc registers "B"))
program instr-ptr' out)
3 (if (= A 0)
(recur registers program instr-ptr' out)
(recur registers program operand out))
4 (recur (->> (bit-xor B C)
(assoc registers "B"))
program instr-ptr' out)
5 (recur registers
program
instr-ptr'
(conj out (mod @combo-operand 8)))
6 (recur (->> (int (/ A (max 1 (bit-shift-left 2 (dec @combo-operand)))))
(assoc registers "B"))
program instr-ptr' out)
7 (recur (->> (int (/ A (max 1 (bit-shift-left 2 (dec @combo-operand)))))
(assoc registers "C"))
program instr-ptr' out))))))
;; part 1
(->> (compute registers program)
first
(interpose ",")
(apply str))
;; part 2
(loop [n 0]
(when (= (mod n 10000) 0)
(println n))
(let [res (try (compute (merge registers {"A" n}) program)
(catch Exception _e
nil))]
(if (= (first res) program)
n
(recur (inc n)))))
(comment
registers
program
(compute {"C" 1} [2 6])
(compute {"A" 10} [5, 0, 5, 1, 5, 4])
(compute {"A" 2024} [0, 1, 5, 4, 3, 0])
(compute {"B" 29} [1, 7])
(compute {"B" 2024, "C" 43690} [4 0])
)