Merge pull request #20 from B-AROL-O/gmacario-dev

feat: add gmacario+gpt-oss-120 solutions to aoc-2025 days 04-09

Author: aleche28

2025/gmacario/day00/README.md

@@ -0,0 +1,36 @@
+# Boilerplate for AoC-2025 daily solver
+
+Perform the following steps:
+
+1. Copy `day00` to the desired day `daynn`
+2. Rename `solve_day00.py` to `solve_daynn.py`
+3. Rename `sample_day00.txt` to `sample_daynn.txt`
+4. Copy the text of Day _nn_ challenge into `README.md`. Make sure to correct Markdown formatting
+5. Copy the sample input for Day _nn_ challenge into `sample_daynn.txt`
+6. Fetch the actual input into `input_daynn.txt`
+7. Read and understand `README.md`
+8. Adjust `solve_daynn.py` accordingly
+9. Test the solution to Part 1 of the challenge:
+
+   ```bash
+   uv run daynn/solve_daynn.py
+   ```
+
+10. Ensure that the solution to `sample_daynn.txt` matches the one in the `README.md`
+11. Repeat steps 7-10 until the solution to Part 1 passes with the sample data
+12. Uncomment line 10 of `solve_daynn.py`, then run the solver against `input_daynn.txt`
+
+    ```bash
+    uv run daynn/solve_daynn.py
+    ```
+
+13. Paste the value in line `INFO:  Daynn solve_part1 result: xxx` into the text field of AoC-2025 Day _nn_ challenge
+14. If everything works, do a `git commit` with the working changes, then proceed to solving Part 2
+15. Comment line 10 of `solve_daynn.py`
+16. Update `README.md` with the text for Part 2 of the challenge
+17. Repeat steps 7-12 until Part 2 is solved
+18. If everything works, do a `git commit` with the working changes
+19. Update the code until all Super-Linter checks are green
+20. Create a Pull Request against <https://github.com/B-AROL-O/advent-of-code>
+
+<!-- EOF -->

2025/gmacario/day00/sample_day00.txt

@@ -0,0 +1 @@
+TODO

2025/gmacario/boilerplate/solve_day00.py 2025/gmacario/day00/solve_day00.py2025/gmacario/boilerplate/solve_day00.py renamed to 2025/gmacario/day00/solve_day00.py

@@ -2,13 +2,14 @@
 
 from icecream import ic
 
+CHALLENGE_YEAR = 2025
 CHALLENGE_DAY = 0
 
-CHALLENGE_URL = f"https://adventofcode.com/2025/day/{CHALLENGE_DAY}"
+CHALLENGE_URL = f"https://adventofcode.com/{CHALLENGE_YEAR}/day/{CHALLENGE_DAY}"
 INPUT_FILE = f"day{CHALLENGE_DAY:02}/sample_day{CHALLENGE_DAY:02}.txt"
 # INPUT_FILE=f"day{CHALLENGE_DAY:02}/input_day{CHALLENGE_DAY:02}.txt"
 
-print(f"INFO:  Advent of Code 2025 - Day {CHALLENGE_DAY}")
+print(f"INFO:  Advent of Code {CHALLENGE_YEAR} - Day {CHALLENGE_DAY}")
 print(f"INFO:  URL: {CHALLENGE_URL}")
 print(f"INFO:  INPUT_FILE: {INPUT_FILE}")
 
@@ -21,11 +22,58 @@
 ic(input_lines)
 
 
+"""
+Credits: TODO
+
+Prompt:
+
+Solve Part One of the following challenge by creating a Python function with the following signature:
+
+```python
+def solve_part1_with_ai(input_lines: List[str]) -> int
+```
+
+where `input_lines` is a list of string produced by reading the input file as per the provided example:
+
+Make sure you get the same result as shown in the example.
+
+Here is the full text of the challenge:
+
+(paste contents of day09/README.md)
+"""
+# def solve_part1_with_ai(input_lines: List[str]) ->int:
+#   pass  # TODO
+
+
+"""
+Credits: TODO
+
+Prompt:
+
+Solve Part Two of the following challenge by creating a Python function with the following signature:
+
+```python
+def solve_part2_with_ai(input_lines: List[str]) -> int
+```
+
+where `input_lines` is a list of string produced by reading the input file as per the provided example:
+
+Make sure you get the same result as shown in the example.
+
+Here is the full text of the challenge:
+
+(paste contents of day00/README.md)
+"""
+# def solve_part2_with_ai(input_lines: List[str]) ->int:
+#   pass  # TODO
+
+
 def solve_part1():
     tm_start = time.time()
     result_part1 = 0
 
     ic("DEBUG: TODO solve_part1()")
+    # result_part1 = solve_part1_with_ai(input_lines)
 
     tm_end = time.time()
     print(f"DEBUG: solve_part1 Begin: {time.ctime(tm_start)}")
@@ -40,6 +88,7 @@ def solve_part2():
     result_part2 = 0
 
     ic("DEBUG: TODO solve_part2()")
+    # result_part2 = solve_part2_with_ai(input_lines)
 
     tm_end = time.time()
     print(f"DEBUG: solve_part2 Begin: {time.ctime(tm_start)}")
@@ -51,9 +100,6 @@ def solve_part2():
 
 if __name__ == "__main__":
     solve_part1()
-    # check_valid_id_part2("1010")
-    # check_valid_id_part2("1011")
     solve_part2()
-    pass
 
 # EOF

2025/gmacario/day04/README.md

@@ -1,6 +1,6 @@
 # --- Day 4: Printing Department ---
 
-<>
+<https://adventofcode.com/2025/day/4>
 
 You ride the escalator down to the printing department. They're clearly getting ready for Christmas; they have lots of large rolls of paper everywhere, and there's even a massive printer in the corner (to handle the really big print jobs).
 

2025/gmacario/day04/solve_day04.py

@@ -1,6 +1,9 @@
 import time
 
-from icecream import ic
+from collections import deque
+from typing import Deque, List, Tuple
+
+# from icecream import ic
 
 CHALLENGE_DAY = 4
 
@@ -21,6 +24,90 @@
 # ic(input_lines)
 
 
+"""
+Credits: <https://openwebui.gmacario.it/c/c19b36fc-d4fe-4bdc-9ca9-f6b178edf237>
+
+Prompt:
+
+Solve Part Two of the following challenge by creating a Python function with the following signature:
+
+```python
+def solve_part2_with_ai(input_lines: List[str]) -> int
+```
+
+where `input_lines` is a list of string produced by reading the input file as per the provided example:
+
+(paste contents of day04/sample_day04.txt)
+
+Here is the full text of the challenge:
+
+(paste contents of day04/README.md)
+"""
+def solve_part2_with_ai(input_lines: List[str]) -> int:
+    """
+    Implements the Part 2 solution described above.
+    Returns the total number of '@' cells that can be removed.
+    """
+    if not input_lines:
+        return 0
+
+    rows = len(input_lines)
+    cols = len(input_lines[0])
+
+    # 1. parse the grid
+    paper = [[c == '@' for c in line] for line in input_lines]
+
+    # 2. auxiliary structures
+    removed = [[False] * cols for _ in range(rows)]
+    deg = [[0] * cols for _ in range(rows)]
+
+    # 8 possible neighbour offsets
+    neigh_offsets = [(-1, -1), (-1, 0), (-1, 1),
+                     (0, -1),           (0, 1),
+                     (1, -1),  (1, 0),  (1, 1)]
+
+    # 3. initial degree computation
+    for i in range(rows):
+        for j in range(cols):
+            if not paper[i][j]:
+                continue
+            cnt = 0
+            for di, dj in neigh_offsets:
+                ni, nj = i + di, j + dj
+                if 0 <= ni < rows and 0 <= nj < cols and paper[ni][nj]:
+                    cnt += 1
+            deg[i][j] = cnt
+
+    # 4. initialise queue with cells of degree < 4
+    q: Deque[Tuple[int, int]] = deque()
+    for i in range(rows):
+        for j in range(cols):
+            if paper[i][j] and deg[i][j] < 4:
+                q.append((i, j))
+
+    removed_cnt = 0
+
+    # 5. iterative removal
+    while q:
+        i, j = q.popleft()
+        if removed[i][j]:
+            continue            # may have been queued earlier
+        removed[i][j] = True
+        removed_cnt += 1
+
+        # decrease degree of still‑present neighbours
+        for di, dj in neigh_offsets:
+            ni, nj = i + di, j + dj
+            if 0 <= ni < rows and 0 <= nj < cols:
+                if paper[ni][nj] and not removed[ni][nj]:
+                    deg[ni][nj] -= 1
+                    # we only need to enqueue when it just crossed the threshold
+                    if deg[ni][nj] == 3:
+                        q.append((ni, nj))
+
+    return removed_cnt
+
+
 def solve_part1():
     tm_start = time.time()
     # result_part1 = 0
@@ -87,7 +174,8 @@ def solve_part2():
     tm_start = time.time()
     result_part2 = 0
 
-    ic("DEBUG: TODO solve_part2()")
+    # ic("DEBUG: TODO solve_part2()")
+    result_part2 = solve_part2_with_ai(input_lines)
 
     tm_end = time.time()
     print(f"DEBUG: solve_part2 Begin: {time.ctime(tm_start)}")

2025/gmacario/day05/solve_day05.py

@@ -1,6 +1,8 @@
 import time
 
-from icecream import ic
+from typing import List
+
+# from icecream import ic
 
 CHALLENGE_DAY = 5
 
@@ -40,6 +42,67 @@
 # ic(available_ingredients)
 
 
+"""
+Credits: <https://openwebui.gmacario.it/c/aa5b67d6-ccb6-4b66-a94f-914f2ba46d67>
+
+Prompt:
+
+Solve Part Two of the following challenge by creating a Python function with the following signature:
+
+```python
+def solve_part2_with_ai(input_lines: List[str]) -> int
+```
+
+where `input_lines` is a list of string produced by reading the input file as per the provided example:
+
+(paste contents of day05/sample_day07.txt)
+
+Here is the full text of the challenge:
+
+(paste contents of day05/README.md)
+"""
+def solve_part2_with_ai(input_lines: List[str]) -> int:
+    """
+    Counts how many distinct integer IDs are covered by the fresh‑ID ranges
+    appearing before the first blank line of the input.
+    """
+    # -----------------------------------------------------------------
+    # 1. read the ranges (stop at the first blank line)
+    ranges = []
+    for line in input_lines:
+        if line.strip() == "":
+            break
+        low_str, high_str = line.split('-')
+        low, high = int(low_str), int(high_str)
+        ranges.append((low, high))
+
+    if not ranges:                # no ranges at all
+        return 0
+
+    # -----------------------------------------------------------------
+    # 2. sort by lower bound
+    ranges.sort(key=lambda p: p[0])
+
+    # 3. merge overlapping / adjacent intervals
+    merged = []
+    cur_low, cur_high = ranges[0]
+
+    for low, high in ranges[1:]:
+        if low <= cur_high + 1:                # overlap or directly adjacent
+            if high > cur_high:
+                cur_high = high
+        else:
+            merged.append((cur_low, cur_high))
+            cur_low, cur_high = low, high
+
+    merged.append((cur_low, cur_high))          # add the last interval
+
+    # -----------------------------------------------------------------
+    # 4. sum their lengths
+    total = sum(high - low + 1 for low, high in merged)
+    return total
+
+
 def solve_part1():
     tm_start = time.time()
     result_part1 = 0
@@ -67,7 +130,8 @@ def solve_part2():
     tm_start = time.time()
     result_part2 = 0
 
-    ic("DEBUG: TODO solve_part2()")
+    # ic("DEBUG: TODO solve_part2()")
+    result_part2 = solve_part2_with_ai(input_lines)
 
     tm_end = time.time()
     print(f"DEBUG: solve_part2 Begin: {time.ctime(tm_start)}")
@@ -79,8 +143,6 @@ def solve_part2():
 
 if __name__ == "__main__":
     solve_part1()
-    # check_valid_id_part2("1010")
-    # check_valid_id_part2("1011")
     solve_part2()
     pass
 

2025/gmacario/day06/README.md

@@ -0,0 +1,41 @@
+# --- Day 6: Trash Compactor ---
+
+After helping the Elves in the kitchen, you were taking a break and helping them re-enact a movie scene when you over-enthusiastically jumped into the garbage chute!
+
+A brief fall later, you find yourself in a garbage smasher. Unfortunately, the door's been magnetically sealed.
+
+As you try to find a way out, you are approached by a family of cephalopods! They're pretty sure they can get the door open, but it will take some time. While you wait, they're curious if you can help the youngest cephalopod with her [math homework](https://adventofcode.com/2021/day/18).
+
+Cephalopod math doesn't look that different from normal math. The math worksheet (your puzzle input) consists of a list of _problems_; each problem has a group of numbers that need to either be either _added_ (`+`) or _multiplied_ (`*`) together.
+
+However, the problems are arranged a little strangely; they seem to be presented next to each other in a very long horizontal list. For example:
+
+```text
+123 328  51 64
+ 45 64  387 23
+  6 98  215 314
+*   +   *   +
+```
+
+Each problem's numbers are arranged vertically; at the bottom of the problem is the symbol for the operation that needs to be performed. Problems are separated by a full column of only spaces. The left/right alignment of numbers within each problem can be ignored.
+
+So, this worksheet contains four problems:
+
+- `123` \* `45` \* `6` = _`33210`_
+- `328` + `64` + `98` = _`490`_
+- `51` \* `387` \* `215` = _`4243455`_
+- `64` + `23` + `314` = _`401`_
+
+To check their work, cephalopod students are given the _grand total_ of adding together all of the answers to the individual problems. In this worksheet, the grand total is `33210` + `490` + `4243455` + `401` = _`4277556`_.
+
+Of course, the actual worksheet is _much_ wider. You'll need to make sure to unroll it completely so that you can read the problems clearly.
+
+Solve the problems on the math worksheet. _What is the grand total found by adding together all of the answers to the individual problems?_
+
+To begin, [get your puzzle input](https://adventofcode.com/2025/day/6/input).
+
+Answer: TODO
+
+You can also \[Share\] this puzzle.
+
+<!-- EOF -->