gaugendre/advent-of-code
1
0
Fork 0
mirror of https://github.com/Crocmagnon/advent-of-code.git synced 2024-11-21 22:18:12 +01:00
Code Issues Projects Releases Packages Wiki Activity

Improve solution for day 1 using combinations

Browse source
This commit is contained in:
Gabriel Augendre 2020-12-01 09:41:23 +01:00
parent c52fe0aa76
commit 0841f8fba6
No known key found for this signature in database
GPG key ID: 1E693F4CE4AEE7B4
1 changed files with 14 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

23
2020/day01-expense.py
View file

@ -1,18 +1,23 @@
from itertools import combinations
from math import prod
def main():
lines = []
with open("inputs/day01") as f:
for line in f:
lines.append(int(line.strip()))
stop = len(lines)
for i, value in enumerate(lines):
for j in range(i+1, stop):
other = lines[j]
for k in range(j+1, stop):
third = lines[k]
addition = other + value + third
if addition == 2020:
print("result is", other * value * third)
res = solve(lines, 2)
print("result is", res)
res = solve(lines, 3)
print("result is", res)
def solve(expense_report, fix_number):
for combination in combinations(expense_report, fix_number):
if sum(combination) == 2020:
return prod(combination)
if __name__ == '__main__':