Anders Englöf Ytterström
5a5e843129
* Solve 2015:16 "Aunt Sue" * Make 2023:08 future compatible Code used to work with another version of python. * Solve 2015:17 "No such Thing as Too much" * Solve 2015:18 "Like a GIF For Your Yard" Also solve 2015:06 just in case, was just a ref in the end. * Solve 2015:19 "Medicine for Rudolph" * Solve 2015:20 "Infinite Elves and Infinite Houses" * Solve 2023:21 "RPG Simulator 20XX" * Solve 2015:22 "Wizard Simulator 20XX" * Solve 2015:23 "Opening the Turing Lock" * Solve 2015:25 "Let it Snow" Wrote p2rc and rc2p just for academic purposes. Puzzles could be solved anyway. * Solve 2015:24 "Hangs in the Balance" --------- Co-authored-by: Anders Englöf Ytterström <anders@playmaker.ai>
50 lines
1.1 KiB
Python
50 lines
1.1 KiB
Python
import re
|
|
from itertools import combinations
|
|
from math import prod
|
|
|
|
from solutions import BaseSolution
|
|
|
|
|
|
class Solution(BaseSolution):
|
|
input_file = "24.txt"
|
|
|
|
def __str__(self):
|
|
return "Day 24: Hangs in the Balance"
|
|
|
|
def solve(self, pi):
|
|
o = self._solve(pi)
|
|
return o[0]
|
|
|
|
def solve_again(self, pi):
|
|
o = self._solve(pi)
|
|
return o[1]
|
|
|
|
def _solve(self, pi):
|
|
p12 = []
|
|
for g in [3, 4]:
|
|
w = [int(s) for s in re.findall(r"\d+", pi)]
|
|
gs = sum(w) // g
|
|
c = []
|
|
for r in range(len(w)):
|
|
for n in combinations(w, r=r):
|
|
if sum(n) == gs:
|
|
c.append(n)
|
|
if c:
|
|
break
|
|
p12.append(min(map(prod, c)))
|
|
return p12
|
|
|
|
def parse_input(self, data):
|
|
return data.strip()
|
|
|
|
|
|
if __name__ == "__main__":
|
|
solution = Solution()
|
|
solution.show_results()
|
|
|
|
dummy = """
|
|
1,2,3,4,5,7,8,9,10,11
|
|
""".strip()
|
|
|
|
solution.solve(dummy)
|
|
# solution.solve_again(dummy)
|