Merge branch 'master' into get_time

Author: KateFinegan

.gitignore

@@ -8,6 +8,7 @@ __pycache__/
 
 # C extensions
 *.so
+*.o
 
 # Distribution / packaging
 .Python

advent-of-code/README.md

@@ -0,0 +1,34 @@
+# Advent of Code: Solving Your Puzzles With Python
+
+This repository holds the code for the Real Python [Advent of Code: Solving Your Puzzles With Python](https://realpython.com/python-advent-of-code/) tutorial.
+
+## Dependencies
+
+[Pytest](https://realpython.com/pytest-python-testing/) is used for testing. You should first create a virtual environment:
+
+```console
+$ python -m venv venv
+$ source venv/bin/activate
+```
+
+You can then install `pytest` with `pip`:
+
+```console
+(venv) $ python -m pip install pytest
+```
+
+The [aoc_grid.py](aoc_grid.py) example uses [Colorama](https://pypi.org/project/colorama/) and [NumPy](https://realpython.com/numpy-tutorial/). To run that example, you should also install those packages into your environment:
+
+```console
+(venv) $ python -m pip install colorama numpy
+```
+
+The puzzle solutions only use Python's standard library. Note that the solution to [Day 5, 2021](solutions/2021/05_hydrothermal_venture/) uses [structural pattern matching](https://realpython.com/python310-new-features/#structural-pattern-matching) which is only available in [Python 3.10](https://realpython.com/python310-new-features/) and later.
+
+## Author
+
+- **Geir Arne Hjelle**, E-mail: [[email protected]]([email protected])
+
+## License
+
+Distributed under the MIT license. See [`LICENSE`](../LICENSE) for more information.

advent-of-code/aoc_grid.py

@@ -0,0 +1,18 @@
+import numpy as np
+from colorama import Cursor
+
+grid = np.array(
+    [
+        [1, 1, 1, 1, 1],
+        [1, 0, 0, 0, 1],
+        [1, 1, 1, 0, 1],
+        [1, 0, 0, 2, 1],
+        [1, 1, 1, 1, 1],
+    ]
+)
+
+num_rows, num_cols = grid.shape
+for row in range(num_rows):
+    for col in range(num_cols):
+        symbol = " *o"[grid[row, col]]
+        print(f"{Cursor.POS(col + 1, row + 2)}{symbol}")

advent-of-code/aoc_state_machine.py

@@ -0,0 +1,26 @@
+from dataclasses import dataclass
+
+
+@dataclass
+class StateMachine:
+    memory: dict[str, int]
+    program: list[str]
+
+    def run(self):
+        """Run the program"""
+        current_line = 0
+        while current_line < len(self.program):
+            instruction = self.program[current_line]
+
+            # Set a register to a value
+            if instruction.startswith("set "):
+                register, value = instruction[4], int(instruction[6:])
+                self.memory[register] = value
+
+            # Increase the value in a register by 1
+            elif instruction.startswith("inc "):
+                register = instruction[4]
+                self.memory[register] += 1
+
+            # Move the line pointer
+            current_line += 1

advent-of-code/solutions/2019/01_the_tyranny_of_the_rocket_equation/README.md

@@ -0,0 +1,6 @@
+# Day 1, 2019: The Tyranny of the Rocket Equation
+
+Resources:
+
+- **Puzzle:** [adventofcode.com](https://adventofcode.com/2019/day/1)
+- **Solution:** [realpython.com](https://realpython.com/python-advent-of-code/#practicing-advent-of-code-day-1-2019)

advent-of-code/solutions/2019/01_the_tyranny_of_the_rocket_equation/aoc201901.py

@@ -0,0 +1,51 @@
+"""AoC 1, 2019: The Tyranny of the Rocket Equation"""
+
+# Standard library imports
+import pathlib
+import sys
+
+
+def parse(puzzle_input):
+    """Parse input"""
+    return [int(line) for line in puzzle_input.split("\n")]
+
+
+def part1(module_masses):
+    """Solve part 1"""
+    return sum(mass // 3 - 2 for mass in module_masses)
+
+
+def part2(module_masses):
+    """Solve part 2"""
+    return sum(all_fuel(mass) for mass in module_masses)
+
+
+def all_fuel(mass):
+    """Calculate fuel while taking mass of the fuel into account.
+
+    ## Example:
+
+    >>> all_fuel(1969)
+    966
+    """
+    fuel = mass // 3 - 2
+    if fuel <= 0:
+        return 0
+    else:
+        return fuel + all_fuel(mass=fuel)
+
+
+def solve(puzzle_input):
+    """Solve the puzzle for the given input"""
+    data = parse(puzzle_input)
+    solution1 = part1(data)
+    solution2 = part2(data)
+
+    return solution1, solution2
+
+
+if __name__ == "__main__":
+    for path in sys.argv[1:]:
+        print(f"\n{path}:")
+        solutions = solve(puzzle_input=pathlib.Path(path).read_text().strip())
+        print("\n".join(str(solution) for solution in solutions))

advent-of-code/solutions/2019/01_the_tyranny_of_the_rocket_equation/example1.txt

@@ -0,0 +1,4 @@
+12
+14
+1969
+100756

advent-of-code/solutions/2019/01_the_tyranny_of_the_rocket_equation/test_aoc201901.py

@@ -0,0 +1,31 @@
+"""Tests for AoC 1, 2019: The Tyranny of the Rocket Equation"""
+
+# Standard library imports
+import pathlib
+
+# Third party imports
+import aoc201901 as aoc
+import pytest
+
+PUZZLE_DIR = pathlib.Path(__file__).parent
+
+
+@pytest.fixture
+def example1():
+    puzzle_input = (PUZZLE_DIR / "example1.txt").read_text().strip()
+    return aoc.parse(puzzle_input)
+
+
+def test_parse_example1(example1):
+    """Test that input is parsed properly"""
+    assert example1 == [12, 14, 1969, 100756]
+
+
+def test_part1_example1(example1):
+    """Test part 1 on example input"""
+    assert aoc.part1(example1) == 2 + 2 + 654 + 33583
+
+
+def test_part2_example1(example1):
+    """Test part 2 on example input"""
+    assert aoc.part2(example1) == 2 + 2 + 966 + 50346

advent-of-code/solutions/2020/01_report_repair/README.md

@@ -0,0 +1,6 @@
+# Day 1, 2020: Report Repair
+
+Resources:
+
+- **Puzzle:** [adventofcode.com](https://adventofcode.com/2020/day/1)
+- **Solution:** [realpython.com](https://realpython.com/python-advent-of-code/#the-structure-of-a-solution)

advent-of-code/solutions/2020/01_report_repair/aoc202001.py

@@ -0,0 +1,38 @@
+"""AoC 1, 2020: Report Repair"""
+
+# Standard library imports
+import pathlib
+import sys
+
+
+def parse(puzzle_input):
+    """Parse input"""
+    return [int(line) for line in puzzle_input.split()]
+
+
+def part1(numbers):
+    """Solve part 1"""
+    for num1 in numbers:
+        for num2 in numbers:
+            if num1 < num2 and num1 + num2 == 2020:
+                return num1 * num2
+
+
+def part2(numbers):
+    """Solve part 2"""
+
+
+def solve(puzzle_input):
+    """Solve the puzzle for the given input"""
+    data = parse(puzzle_input)
+    solution1 = part1(data)
+    solution2 = part2(data)
+
+    return solution1, solution2
+
+
+if __name__ == "__main__":
+    for path in sys.argv[1:]:
+        print(f"\n{path}:")
+        solutions = solve(puzzle_input=pathlib.Path(path).read_text().strip())
+        print("\n".join(str(solution) for solution in solutions))