-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path09a.py
47 lines (37 loc) · 1.01 KB
/
09a.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
def read_arr(fpath='data/09-demo.txt'):
with open(fpath) as f:
arr = [int(l.strip()) for l in f.readlines()]
return arr
def get_prev_n(arr, i, n):
return arr[i-n:i]
def prev_n_sums(arr, i, n):
prev_n = get_prev_n(arr, i, n)
print('prev_n:', prev_n)
# s = set()
s = set()
for i in range(n):
for j in range(i+1, n):
# print(i, j)
# print(prev_n[i], prev_n[j], prev_n[i] + prev_n[j])
s.add(prev_n[i] + prev_n[j])
return s
def find_invalid_val(arr, n):
for i in range(n, len(arr)+1):
# for i in range(n, n+1):
print(i)
# prev_n = get_prev_n(arr, i, n)
# print(prev_n)
s = prev_n_sums(arr=arr, i=i, n=n)
# print(s)
if arr[i] in s:
print(i, arr[i], 'valid!')
else:
print(i, arr[i], 'INVALID!')
return arr[i]
# arr = read_arr()
n = 5
arr = read_arr(fpath='data/09.txt')
n = 25
print(arr)
sol = find_invalid_val(arr=arr, n=n)
print('sol:', sol)