<gh_stars>1-10
'''
11:
In the 20x20 grid below, four numbers along a diagonal line have been marked in red.
The product of these numbers is 26 * 63 * 78 * 14 = 1788696.
What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20x20 grid?
'''

a = [""] * 20
#		0  1  2  3  4  5  6  7  8  9  10 11 12 13 14 15 16 17 18 19
a[0] = "08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08".split(" ")
a[1] = "49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00".split(" ")
a[2] = "81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65".split(" ")
a[3] = "52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91".split(" ")
a[4] = "22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80".split(" ")
a[5] = "24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50".split(" ")
a[6] = "32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70".split(" ")
a[7] = "67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21".split(" ")
a[8] = "24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72".split(" ")
a[9] = "21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95".split(" ")
a[10] ="78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92".split(" ")
a[11] ="16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57".split(" ")
a[12] ="86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58".split(" ")
a[13] ="19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40".split(" ")
a[14] ="04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66".split(" ")
a[15] ="88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69".split(" ")
a[16] ="04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36".split(" ")
a[17] ="20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16".split(" ")
a[18] ="20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54".split(" ")
a[19] ="01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48".split(" ")


def pri_diagonal():
	ret = 0
	for i in range(0,17):
		for j in range(0,17):
			resp = int(a[i][j])*int(a[i+1][j+1])*int(a[i+2][j+2])*int(a[i+3][j+3])
			#print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp)
			if resp > ret:
				ret = resp
	return ret

def sec_diagonal():
	ret = 0
	for i in range(0,17):
		for j in range(3,20):
			resp = int(a[i][j])*int(a[i+1][j-1])*int(a[i+2][j-2])*int(a[i+3][j-3])
			#print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp)
			if resp > ret:
				ret = resp
	return ret

def left_right():
	ret = 0
	for i in range(0,20):
		for j in range(0,17):
			resp = int(a[i][j])*int(a[i][j+1])*int(a[i][j+2])*int(a[i][j+3])
			#print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp)
			if resp > ret:
				ret = resp
	return ret

def up_down():
	ret = 0
	for i in range(0,17):
		for j in range(0,20):
			resp = int(a[i][j])*int(a[i+1][j])*int(a[i+2][j])*int(a[i+3][j])
			#print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp)
			if resp > ret:
				ret = resp
	return ret


def execute():
	print max(pri_diagonal(), sec_diagonal(), left_right(), up_down())
	
execute()
'''
11:
In the 20x20 grid below, four numbers along a diagonal line have been marked in red.
The product of these numbers is 26 * 63 * 78 * 14 = 1788696.
What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20x20 grid?
'''

a = [""] * 20
#		0  1  2  3  4  5  6  7  8  9  10 11 12 13 14 15 16 17 18 19
a[0] = "08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08".split(" ")
a[1] = "49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00".split(" ")
a[2] = "81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65".split(" ")
a[3] = "52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91".split(" ")
a[4] = "22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80".split(" ")
a[5] = "24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50".split(" ")
a[6] = "32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70".split(" ")
a[7] = "67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21".split(" ")
a[8] = "24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72".split(" ")
a[9] = "21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95".split(" ")
a[10] ="78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92".split(" ")
a[11] ="16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57".split(" ")
a[12] ="86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58".split(" ")
a[13] ="19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40".split(" ")
a[14] ="04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66".split(" ")
a[15] ="88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69".split(" ")
a[16] ="04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36".split(" ")
a[17] ="20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16".split(" ")
a[18] ="20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54".split(" ")
a[19] ="01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48".split(" ")


def pri_diagonal():
	ret = 0
	for i in range(0,17):
		for j in range(0,17):
			resp = int(a[i][j])*int(a[i+1][j+1])*int(a[i+2][j+2])*int(a[i+3][j+3])
			#print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp)
			if resp > ret:
				ret = resp
	return ret

def sec_diagonal():
	ret = 0
	for i in range(0,17):
		for j in range(3,20):
			resp = int(a[i][j])*int(a[i+1][j-1])*int(a[i+2][j-2])*int(a[i+3][j-3])
			#print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp)
			if resp > ret:
				ret = resp
	return ret

def left_right():
	ret = 0
	for i in range(0,20):
		for j in range(0,17):
			resp = int(a[i][j])*int(a[i][j+1])*int(a[i][j+2])*int(a[i][j+3])
			#print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp)
			if resp > ret:
				ret = resp
	return ret

def up_down():
	ret = 0
	for i in range(0,17):
		for j in range(0,20):
			resp = int(a[i][j])*int(a[i+1][j])*int(a[i+2][j])*int(a[i+3][j])
			#print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp)
			if resp > ret:
				ret = resp
	return ret


def execute():
	print max(pri_diagonal(), sec_diagonal(), left_right(), up_down())
	
execute()
11: In the 20x20 grid below, four numbers along a diagonal line have been marked in red. The product of these numbers is 26 * 63 * 78 * 14 = 1788696. What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20x20 grid? #		0  1  2  3  4  5  6  7  8  9  10 11 12 13 14 15 16 17 18 19 #print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp) #print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp) #print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp) #print "(%s, %s) = %s  -  mult = %s" %(i, j, a[i][j], resp)