ProjectEulerSolutions/project0011.py at master · jbrdge/ProjectEulerSolutions · GitHub

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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#checks the following 20x20 grid for the greatest product of 4 adjacent numbers
#checks up=down, left=right, and diagonally
#

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

a1 = '08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08'
a2 = '49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00'
a3 = '81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65'
a4 = '52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91'
a5 = '22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80'
a6 = '24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50'
a7 = '32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70'
a8 = '67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21'
a9 = '24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72'
a10 = '21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95'
a11 = '78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92'
a12 = '16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57'
a13 = '86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58'
a14 = '19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40'
a15 = '04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66'
a16 = '88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69'
a17 = '04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36'
a18 = '20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16'
a19 = '20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54'
a20 = '01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48'
a1 = [int(x) for x in a1.split()]
a2 = [int(x) for x in a2.split()]
a3 = [int(x) for x in a3.split()]
a4 = [int(x) for x in a4.split()]
a5 = [int(x) for x in a5.split()]
a6 = [int(x) for x in a6.split()]
a7 = [int(x) for x in a7.split()]
a8 = [int(x) for x in a8.split()]
a9 = [int(x) for x in a9.split()]
a10 = [int(x) for x in a10.split()]
a11 = [int(x) for x in a11.split()]
a12 = [int(x) for x in a12.split()]
a13 = [int(x) for x in a13.split()]
a14 = [int(x) for x in a14.split()]
a15 = [int(x) for x in a15.split()]
a16 = [int(x) for x in a16.split()]
a17 = [int(x) for x in a17.split()]
a18 = [int(x) for x in a18.split()]
a19 = [int(x) for x in a19.split()]
a20 = [int(x) for x in a20.split()]
a = [a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12,a13,a14,a15,a16,a17,a18,a19,a20]

for r in a:
  print r

products =[]
#loop1 check left(is same as right), all have same row, cols go up
for i in range(0,20):
  for j in range(0,17):
	current_product= a[i][j]*a[i][j+1]*a[i][j+2]*a[i][j+3]
	products.append(current_product)
#loop2 check down(is same as up), all have same col, rows go up
for i in range(0,17):
  for j in range(0,20):
	current_product= a[i][j]*a[i+1][j]*a[i+2][j]*a[i+3][j]
	products.append(current_product)
#loop3 negatively diagonal
for i in range(0,17):
  for j in range(0,17):
	current_product= a[i][j]*a[i+1][j+1]*a[i+2][j+2]*a[i+3][j+3]
	products.append(current_product)
#loop4 positively diagonal
for i in range(0,17):
  for j in range(3,20):
	current_product= a[i][j]*a[i+1][j-1]*a[i+2][j-2]*a[i+3][j-3]
	products.append(current_product)
products.sort()
print len(products)
print products[-1]