problem011.py (3683B)
1 # problemName = "Largest product in a grid" 2 # problemNum = 11 3 # solutionBy = "FIGBERT" 4 # language = "Python" 5 # dateCompleted = "01/02/2020" 6 7 VAL = [] 8 STRVAL = """ 9 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 10 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 11 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65 12 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91 13 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80 14 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50 15 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 16 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 17 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72 18 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95 19 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92 20 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57 21 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58 22 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40 23 04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66 24 88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69 25 04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36 26 20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16 27 20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54 28 01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48 29 """.strip() 30 for line in STRVAL.splitlines(): 31 VAL.append([int(number) for number in line.split()]) 32 33 def largest_vertical(lst): 34 largest = 0 35 for i, _ in enumerate(lst): 36 if i + 4 <= len(lst): 37 for k, _ in enumerate(lst[i]): 38 vertical_mult = 1 39 for j in range(4): 40 vertical_mult *= lst[i+j][k] 41 largest = vertical_mult if vertical_mult > largest else largest 42 return largest 43 44 def largest_horizontal(lst): 45 largest = 0 46 for i, _ in enumerate(lst): 47 for k, _ in enumerate(lst[i]): 48 if k + 4 <= len(lst[i]): 49 horizontal_mult = 1 50 for j in range(4): 51 horizontal_mult *= lst[i][k+j] 52 if horizontal_mult > largest: 53 largest = horizontal_mult 54 return largest 55 56 def largest_diagonal(lst): 57 largest = 0 58 for i, _ in enumerate(lst): 59 for k, _ in enumerate(lst): 60 if i - 3 >= 0: 61 if k - 3 <= 0: 62 up_left = 1 63 for j in range(4): 64 up_left *= lst[i-j][i-k] 65 largest = up_left if up_left > largest else largest 66 if k + 4 <= len(lst[i]): 67 up_right = 1 68 for j in range(4): 69 up_right *= lst[i-j][k+j] 70 largest = up_right if up_right > largest else largest 71 if i + 4 <= len(lst[i]): 72 if k - 3 <= 0: 73 down_left = 1 74 for j in range(4): 75 down_left *= lst[i+j][k-j] 76 largest = down_left if down_left > largest else largest 77 if k + 4 <= len(lst[i]): 78 down_right = 1 79 for j in range(4): 80 down_right *= lst[i+j][k+j] 81 largest = down_right if down_right > largest else largest 82 return largest 83 84 if __name__ == "__main__": 85 diagonal = largest_diagonal(VAL) 86 horizontal = largest_horizontal(VAL) 87 vertical = largest_vertical(VAL) 88 answer = max([diagonal, horizontal, vertical]) 89 print(( 90 "The greatest product of four adjacent numbers in the same " 91 f"direction in the 20×20 grid is {answer}" 92 ))