Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import numpy as np
- from copy import deepcopy as copy
- # 2 2 2 2 2 2 2 2 2 2 0
- file = "/Users/jootiee/Documents/IT/ege/igor/1104/27-A.txt"
- k = 10
- with open(file, "r") as f:
- data = list(map(int, f.readlines()))
- sums = [0] * k
- bestsum = 0
- for line in data[1:5]:
- x = int(line)
- for i in range(k):
- if x % 2:
- if (sums[i] or i == 0):
- sums[i] += x
- else:
- # prev_S_rolled = np.roll(S.copy(), 1)
- prev_S_rolled = copy([sums[k - 1]] + sums[:-1])
- # print(sums, prev_S_rolled)
- if (prev_S_rolled[i] or (i == 1)):
- sums[i] = prev_S_rolled[i] + x
- print(sums)
- # print()
- # print(prev_S_rolled)
- bestsum = max(sums[0], bestsum)
- print(bestsum)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement