Python/Project Euler/Problem 11/sol2.py

def main():
	with open ("grid.txt", "r") as f:
		l = []
		for i in range(20):
			l.append([int(x) for x in f.readline().split()])

		maximum = 0

		# right
		for i in range(20):
			for j in range(17):
				temp = l[i][j] * l[i][j+1] * l[i][j+2] * l[i][j+3]
				if temp > maximum:
					maximum = temp

		# down 
		for i in range(17):
			for j in range(20):
				temp = l[i][j] * l[i+1][j] * l[i+2][j] * l[i+3][j]
				if temp > maximum:
					maximum = temp

		#diagonal 1
		for i in range(17):
			for j in range(17):
				temp = l[i][j] * l[i+1][j+1] * l[i+2][j+2] * l[i+3][j+3]
				if temp > maximum:
					maximum = temp
				
		#diagonal 2
		for i in range(17):
			for j in range(3, 20):
				temp = l[i][j] * l[i+1][j-1] * l[i+2][j-2] * l[i+3][j-3]
				if temp > maximum:
					maximum = temp
		print(maximum)

if __name__ == '__main__':
	main()