Advent of Code 2015 day 20 part 1&2: solved

2015/day20/input.txt

@@ -0,0 +1 @@
+36000000

2015/day20/problem.txt

@@ -0,0 +1,35 @@
+--- Day 20: Infinite Elves and Infinite Houses ---
+To keep the Elves busy, Santa has them deliver some presents by hand, door-to-door. He sends them down a street with infinite houses numbered sequentially: 1, 2, 3, 4, 5, and so on.
+
+Each Elf is assigned a number, too, and delivers presents to houses based on that number:
+
+The first Elf (number 1) delivers presents to every house: 1, 2, 3, 4, 5, ....
+The second Elf (number 2) delivers presents to every second house: 2, 4, 6, 8, 10, ....
+Elf number 3 delivers presents to every third house: 3, 6, 9, 12, 15, ....
+There are infinitely many Elves, numbered starting with 1. Each Elf delivers presents equal to ten times his or her number at each house.
+
+So, the first nine houses on the street end up like this:
+
+House 1 got 10 presents.
+House 2 got 30 presents.
+House 3 got 40 presents.
+House 4 got 70 presents.
+House 5 got 60 presents.
+House 6 got 120 presents.
+House 7 got 80 presents.
+House 8 got 150 presents.
+House 9 got 130 presents.
+The first house gets 10 presents: it is visited only by Elf 1, which delivers 1 * 10 = 10 presents. The fourth house gets 70 presents, because it is visited by Elves 1, 2, and 4, for a total of 10 + 20 + 40 = 70 presents.
+
+What is the lowest house number of the house to get at least as many presents as the number in your puzzle input?
+
+Your puzzle answer was 831600.
+
+--- Part Two ---
+The Elves decide they don't want to visit an infinite number of houses. Instead, each Elf will stop after delivering presents to 50 houses. To make up for it, they decide to deliver presents equal to eleven times their number at each house.
+
+With these changes, what is the new lowest house number of the house to get at least as many presents as the number in your puzzle input?
+
+Your puzzle answer was 884520.
+
+Both parts of this puzzle are complete! They provide two gold stars: **

2015/day20/solution.py

@@ -0,0 +1,29 @@
+import numpy as np
+
+
+def get_first_house_with_x_present(presents: int, presents_per_house: int = 10, part2: bool = False) -> int:
+    max_house = presents // presents_per_house
+    houses = [0 for _ in range(max_house + 1)]
+    for number in range(1, max_house + 1):
+        all_houses = np.arange(start=number, stop=max_house+1, step=number)
+        if part2:
+            all_houses = all_houses[:50]
+        for house in all_houses:
+            houses[house] += number * presents_per_house
+    i = 0
+    while houses[i] < presents:
+        i += 1
+
+    return i
+
+
+if __name__ == '__main__':
+    assert get_first_house_with_x_present(70) == 4, "Error: Example 1 couldn't be solved"
+    assert get_first_house_with_x_present(120) == 6, "Error: Example 2 couldn't be solved"
+    print("All test passed")
+
+    puzzle_input = int(open("input.txt", "r").readline())
+    print("solution: ", get_first_house_with_x_present(puzzle_input, 10))
+
+    print("Part2: ")
+    print("solution: ", get_first_house_with_x_present(puzzle_input, 11, True))