-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathday1.py
48 lines (40 loc) · 1.11 KB
/
day1.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
"""
https://adventofcode.com/2020/day/1
"""
def get_list(file):
with open(file) as f:
lines = [int(line.rstrip()) for line in f]
return lines
def find_pair(num_list: list, nums_sum: int) -> (int, int):
nums = sorted(num_list)
i, j = 0, len(nums) - 1
while True:
if nums[i] + nums[j] == nums_sum:
return (nums[i], nums[j])
elif nums[i] + nums[j] > nums_sum:
j -= 1
elif nums[i] + nums[j] < nums_sum:
i += 1
else:
return (-1, -1)
def find_triple(num_list: list, num_sum: int):
for i in num_list:
for j in num_list:
for k in num_list:
if i != j and i != k:
if i + j + k == num_sum:
return i, j, k
return -1, -1, -1
def multiply(nums):
res = 1
for n in nums:
res *= n
return res
if __name__ == '__main__':
number_l = get_list('input1.txt')
p = find_pair(number_l, 2020)
print(p, sum(p))
print('pair', multiply(p))
t = find_triple(number_l, 2020)
print(t, sum(t))
print('triple', multiply(t))