mirror of
https://github.com/jneug/adventofcode.git
synced 2026-04-14 14:43:34 +02:00
2020 - Day 1
This commit is contained in:
21
2020/day1_2.py
Normal file
21
2020/day1_2.py
Normal file
@@ -0,0 +1,21 @@
|
||||
input = []
|
||||
with open('day1_input.txt', 'r') as f:
|
||||
for line in f.readlines():
|
||||
input.append(int(line))
|
||||
|
||||
def find_sum(nums, s, idx):
|
||||
for i in range(len(nums)-idx-1):
|
||||
for j in range(len(nums)-i-2):
|
||||
if nums[i+idx+1]+nums[j+i+2] == s:
|
||||
return (i+idx+1,j+i+2)
|
||||
return None
|
||||
|
||||
res = None
|
||||
for i in range(len(input)):
|
||||
res = find_sum(input, 2020-input[i], i)
|
||||
if res:
|
||||
res = (input[i], input[res[0]], input[res[1]])
|
||||
break
|
||||
print(res)
|
||||
print(sum(res))
|
||||
print(res[0]*res[1]*res[2])
|
||||
Reference in New Issue
Block a user