MCPcopy Create free account
hub / github.com/subbarayudu-j/TheAlgorithms-Python / main

Function main

project_euler/problem_11/sol2.py:1–36  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

1def main():
2 with open ("grid.txt", "r") as f:
3 l = []
4 for i in range(20):
5 l.append([int(x) for x in f.readline().split()])
6
7 maximum = 0
8
9 # right
10 for i in range(20):
11 for j in range(17):
12 temp = l[i][j] * l[i][j+1] * l[i][j+2] * l[i][j+3]
13 if temp > maximum:
14 maximum = temp
15
16 # down
17 for i in range(17):
18 for j in range(20):
19 temp = l[i][j] * l[i+1][j] * l[i+2][j] * l[i+3][j]
20 if temp > maximum:
21 maximum = temp
22
23 #diagonal 1
24 for i in range(17):
25 for j in range(17):
26 temp = l[i][j] * l[i+1][j+1] * l[i+2][j+2] * l[i+3][j+3]
27 if temp > maximum:
28 maximum = temp
29
30 #diagonal 2
31 for i in range(17):
32 for j in range(3, 20):
33 temp = l[i][j] * l[i+1][j-1] * l[i+2][j-2] * l[i+3][j-3]
34 if temp > maximum:
35 maximum = temp
36 print(maximum)
37
38if __name__ == '__main__':
39 main()

Callers 1

sol2.pyFile · 0.70

Calls 1

splitMethod · 0.80

Tested by

no test coverage detected