Added AOC 2022 day 04

www/statics/aoc/2022/04_challenge.txt

@@ -0,0 +1,59 @@
+--- Day 4: Camp Cleanup ---
+
+Space needs to be cleared before the last supplies can be unloaded from the ships, and so several Elves have been assigned the job of cleaning up sections of the camp. Every section has a unique ID number, and each Elf is assigned a range of section IDs.
+
+However, as some of the Elves compare their section assignments with each other, they've noticed that many of the assignments overlap. To try to quickly find overlaps and reduce duplicated effort, the Elves pair up and make a big list of the section assignments for each pair (your puzzle input).
+
+For example, consider the following list of section assignment pairs:
+
+2-4,6-8
+2-3,4-5
+5-7,7-9
+2-8,3-7
+6-6,4-6
+2-6,4-8
+
+For the first few pairs, this list means:
+
+    Within the first pair of Elves, the first Elf was assigned sections 2-4 (sections 2, 3, and 4), while the second Elf was assigned sections 6-8 (sections 6, 7, 8).
+    The Elves in the second pair were each assigned two sections.
+    The Elves in the third pair were each assigned three sections: one got sections 5, 6, and 7, while the other also got 7, plus 8 and 9.
+
+This example list uses single-digit section IDs to make it easier to draw; your actual list might contain larger numbers. Visually, these pairs of section assignments look like this:
+
+.234.....  2-4
+.....678.  6-8
+
+.23......  2-3
+...45....  4-5
+
+....567..  5-7
+......789  7-9
+
+.2345678.  2-8
+..34567..  3-7
+
+.....6...  6-6
+...456...  4-6
+
+.23456...  2-6
+...45678.  4-8
+
+Some of the pairs have noticed that one of their assignments fully contains the other. For example, 2-8 fully contains 3-7, and 6-6 is fully contained by 4-6. In pairs where one assignment fully contains the other, one Elf in the pair would be exclusively cleaning sections their partner will already be cleaning, so these seem like the most in need of reconsideration. In this example, there are 2 such pairs.
+
+In how many assignment pairs does one range fully contain the other?
+
+--- Part Two ---
+
+It seems like there is still quite a bit of duplicate work planned. Instead, the Elves would like to know the number of pairs that overlap at all.
+
+In the above example, the first two pairs (2-4,6-8 and 2-3,4-5) don't overlap, while the remaining four pairs (5-7,7-9, 2-8,3-7, 6-6,4-6, and 2-6,4-8) do overlap:
+
+    5-7,7-9 overlaps in a single section, 7.
+    2-8,3-7 overlaps all of the sections 3 through 7.
+    6-6,4-6 overlaps in a single section, 6.
+    2-6,4-8 overlaps in sections 4, 5, and 6.
+
+So, in this example, the number of overlapping assignment pairs is 4.
+
+In how many assignment pairs do the ranges overlap?

www/statics/aoc/2022/04_solution-1.nim

@@ -0,0 +1,35 @@
+import std/strutils
+import std/sequtils
+
+proc run04_1(): string =
+    const input = staticRead"../input/day04.txt"
+
+    var ctr = 0
+
+    let lines = splitLines(input).filter(proc(p: string): bool = p != "")
+
+    for line in lines:
+
+        let pairs = line.split(",")
+        let sec1s = parseInt(pairs[0].split("-")[0])
+        let sec1e = parseInt(pairs[0].split("-")[1])
+        let sec2s = parseInt(pairs[1].split("-")[0])
+        let sec2e = parseInt(pairs[1].split("-")[1])
+
+        if sec1s <= sec2s and sec2e <= sec1e:
+            ctr+=1 # sec2 in sec1
+            echo "[", sec2s, "..", sec2e, "]", " fully in ", "[", sec1s, "..", sec1e, "]"
+        elif sec2s <= sec1s and sec1e <= sec2e:
+            ctr+=1 # sec1 in sec2
+            echo "[", sec1s, "..", sec1e, "]", " fully in ", "[", sec2s, "..", sec2e, "]"
+        else:
+            echo "[", sec1s, "..", sec1e, "]", " no overlap ", "[", sec2s, "..", sec2e, "]"
+
+    return intToStr(ctr)
+
+
+when not defined(js):
+    echo run04_1()
+else:
+    proc js_run04_1(): cstring {.exportc.} =
+        return cstring(run04_1())

www/statics/aoc/2022/04_solution-2.nim

@@ -0,0 +1,34 @@
+import std/strutils
+import std/sequtils
+
+proc run04_2(): string =
+    const input = staticRead"../input/day04.txt"
+
+    var ctr = 0
+
+    let lines = splitLines(input).filter(proc(p: string): bool = p != "")
+
+    for line in lines:
+
+        let pairs = line.split(",")
+        let sec1s = parseInt(pairs[0].split("-")[0])
+        let sec1e = parseInt(pairs[0].split("-")[1])
+        let sec2s = parseInt(pairs[1].split("-")[0])
+        let sec2e = parseInt(pairs[1].split("-")[1])
+
+        if (sec1s <= sec2s and sec2s <= sec1e) or (sec1s <= sec2e and sec2e <= sec1e):
+            ctr+=1
+            echo "[", sec2s, "..", sec2e, "]", " overlaps ", "[", sec1s, "..", sec1e, "]"
+        elif (sec2s <= sec1s and sec1s <= sec2e) or (sec2s <= sec1e and sec1e <= sec2e):
+            ctr+=1
+            echo "[", sec2s, "..", sec2e, "]", " overlaps ", "[", sec1s, "..", sec1e, "]"
+        else:
+            echo "[", sec1s, "..", sec1e, "]", " nolap ", "[", sec2s, "..", sec2e, "]"
+
+    return intToStr(ctr)
+
+when not defined(js):
+    echo run04_2()
+else:
+    proc js_run04_2(): cstring {.exportc.} =
+        return cstring(run04_2())

www/statics/aoc/__all.php

@@ -110,5 +110,6 @@ return
 			['day' =>  1, 'parts' => 2, 'title' => 'Calorie Counting',                        'language' => 'nim',  'solutions' => ['66719', '198551'] ],
 			['day' =>  2, 'parts' => 2, 'title' => 'Rock Paper Scissors',                     'language' => 'nim',  'solutions' => ['14297', '10498'] ],
 			['day' =>  3, 'parts' => 2, 'title' => 'Rucksack Reorganization',                 'language' => 'nim',  'solutions' => ['7889', '2825'] ],
+			['day' =>  4, 'parts' => 2, 'title' => 'Camp Cleanup',                            'language' => 'nim',  'solutions' => ['550', '931'] ],
 		]
 	];