blob: 4fff9d427b101a390346b7d318dedd1bac8344b9 (
plain)
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
49
50
|
numbers = []
f = open('011.txt', 'r')
for line in f:
line.rstrip('\n')
line_str = line.split(' ')
line_int = [ int(x) for x in line_str ]
numbers.append(line_int)
f.close()
def find_down():
max = 0
for i in range(0, 17):
for j in range(0, 20):
product = numbers[i][j] * numbers[i+1][j] * numbers[i+2][j] * numbers[i+3][j]
if product > max:
max = product
return max
def find_right():
max = 0
for i in range(0, 20):
for j in range(0, 17):
product = numbers[i][j] * numbers[i][j+1] * numbers[i][j+2] * numbers[i][j+3]
if product > max:
max = product
return max
def find_diagonal1():
max = 0
for i in range(0, 17):
for j in range(0, 17):
product = numbers[i][j] * numbers[i+1][j+1] * numbers[i+2][j+2] * numbers[i+3][j+3]
if product > max:
max = product
return max
def find_diagonal2():
max = 0
for i in range(0, 17):
for j in range(0, 17):
product = numbers[i][19-j] * numbers[i+1][18-j] * numbers[i+2][17-j] * numbers[i+3][16-j]
if product > max:
max = product
return max
print max(find_down(), find_right(), find_diagonal1(), find_diagonal2())
|
