ajet/advent-of-code
1
0
Fork 0
mirror of https://github.com/Ajetski/advent-of-code.git synced 2025-09-30 13:03:19 -09:00
Code Issues Packages Projects Releases Wiki Activity

golf

Browse Source
This commit is contained in:
Adam Jeniski 2023-12-06 00:35:55 -05:00
parent ff09b6d9dc
commit e1650bd8f6
1 changed files with 10 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
2023/src/day06.clj
View File

@ -5,26 +5,23 @@
(def input (->> (get-puzzle-input 6))) (def input (->> (get-puzzle-input 6)))
(defn ways-to-beat [[ms record]] (defn solve [num-str-lists]
(->> (range 1 ms) (->> (map (partial map #(Long/parseLong %)) num-str-lists)
(pmap #(* % (- ms %))) (apply zipmap)
(filter #(> % record)) (map (fn [[ms record]] (->> (range 1 ms)
(count))) (map #(* % (- ms %)))
(filter #(> % record))
(count))))
(reduce *)))
;; part 1 ;; part 1
(->> input (->> input
(map (partial re-seq #"\d+")) (map (partial re-seq #"\d+"))
(map (partial map #(Long/parseLong %))) solve)
(apply zipmap)
(map ways-to-beat)
(reduce *))
;; part 2 ;; part 2
(->> input (->> input
(map (partial re-seq #"[\s\d]+")) (map (partial re-seq #"[\s\d]+"))
(map (partial map #(string/replace % " " ""))) (map (partial map #(string/replace % " " "")))
(map (partial map #(Long/parseLong %))) solve)
(apply zipmap)
(map ways-to-beat)
(reduce *))