-
Notifications
You must be signed in to change notification settings - Fork 0
/
14500.py
106 lines (84 loc) · 4.27 KB
/
14500.py
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
95
96
97
98
99
100
101
102
103
104
105
106
import sys
n, m = map(int, input().split())
boardlst = []
largest = 0
tempsum = 0
for _ in range(n):
boardlst.append(list(map(int, sys.stdin.readline().split())))
for i in range(n - 1): # ㅜ
for j in range(1, m - 1):
tempsum = boardlst[i][j - 1] + boardlst[i][j] + boardlst[i][j + 1] + boardlst[i + 1][j]
if tempsum > largest: largest = tempsum
for i in range(n - 2): # ㅏ
for j in range(0, m - 1):
tempsum = boardlst[i][j] + boardlst[i + 1][j] + boardlst[i + 2][j] + boardlst[i + 1][j + 1]
if tempsum > largest: largest = tempsum
for i in range(n - 2): # ㅓ
for j in range(1, m):
tempsum = boardlst[i][j] + boardlst[i + 1][j] + boardlst[i + 2][j] + boardlst[i + 1][j - 1]
if tempsum > largest: largest = tempsum
for i in range(1, n): # ㅗ
for j in range(0, m - 2):
tempsum = boardlst[i][j] + boardlst[i][j + 1] + boardlst[i][j + 2] + boardlst[i - 1][j + 1]
if tempsum > largest: largest = tempsum
for i in range(n): # ㅡ
for j in range(m - 3):
tempsum = boardlst[i][j] + boardlst[i][j + 1] + boardlst[i][j + 2] + boardlst[i][j + 3]
if tempsum > largest: largest = tempsum
for i in range(n - 3): # ㅣ
for j in range(m):
tempsum = boardlst[i][j] + boardlst[i + 1][j] + boardlst[i + 2][j] + boardlst[i + 3][j]
if tempsum > largest: largest = tempsum
for i in range(0, n - 1): # ㄱㄴ
for j in range(m - 2):
tempsum = boardlst[i][j] + boardlst[i][j + 1] + boardlst[i + 1][j + 1] + boardlst[i + 1][j + 2]
if tempsum > largest: largest = tempsum
for i in range(1, n): # ㄱㄴ 좌우반전
for j in range(m - 2):
tempsum = boardlst[i][j] + boardlst[i][j + 1] + boardlst[i - 1][j + 1] + boardlst[i - 1][j + 2]
if tempsum > largest: largest = tempsum
for i in range(0, n - 2): # 늑
for j in range(m - 1):
tempsum = boardlst[i][j] + boardlst[i + 1][j] + boardlst[i + 1][j + 1] + boardlst[i + 2][j + 1]
if tempsum > largest: largest = tempsum
for i in range(0, n - 2): # 늑 좌우반전
for j in range(1, m - 1):
tempsum = boardlst[i][j] + boardlst[i + 1][j] + boardlst[i + 1][j - 1] + boardlst[i + 2][j - 1]
if tempsum > largest: largest = tempsum
for i in range(0, n - 2): # L
for j in range(0, m - 1):
tempsum = boardlst[i][j] + boardlst[i + 1][j] + boardlst[i + 2][j] + boardlst[i + 2][j + 1]
if tempsum > largest: largest = tempsum
for i in range(0, n - 2): # L 좌우반전
for j in range(1, m):
tempsum = boardlst[i][j] + boardlst[i + 1][j] + boardlst[i + 2][j] + boardlst[i + 2][j - 1]
if tempsum > largest: largest = tempsum
for i in range(0, n - 1): # ㄴ
for j in range(0, m - 2):
tempsum = boardlst[i][j] + boardlst[i + 1][j] + boardlst[i + 1][j + 1] + boardlst[i + 1][j + 2]
if tempsum > largest: largest = tempsum
for i in range(1, n): # ㄴ 좌우반전
for j in range(0, m - 2):
tempsum = boardlst[i][j] + boardlst[i][j + 1] + boardlst[i][j + 2] + boardlst[i - 1][j + 2]
if tempsum > largest: largest = tempsum
for i in range(0, n - 1): # ㄱ 인데 가로로 긴거
for j in range(0, m - 2):
tempsum = boardlst[i][j] + boardlst[i][j + 1] + boardlst[i][j + 2] + boardlst[i + 1][j + 2]
if tempsum > largest: largest = tempsum
for i in range(0, n - 2): # ㄱ 인데 세로로 긴거
for j in range(0, m - 1):
tempsum = boardlst[i][j] + boardlst[i][j + 1] + boardlst[i + 1][j + 1] + boardlst[i + 2][j + 1]
if tempsum > largest: largest = tempsum
for i in range(0, n - 1): # ㄱ 인데 가로로 긴거 좌우반전
for j in range(0, m - 2):
tempsum = boardlst[i][j] + boardlst[i][j + 1] + boardlst[i][j + 2] + boardlst[i + 1][j]
if tempsum > largest: largest = tempsum
for i in range(0, n - 2): # ㄱ 인데 세로로 긴거 좌우반전
for j in range(0, m - 1):
tempsum = boardlst[i][j] + boardlst[i][j + 1] + boardlst[i + 1][j] + boardlst[i + 2][j]
if tempsum > largest: largest = tempsum
for i in range(0, n - 1): # ㄱ 인데 세로로 긴거 좌우반전
for j in range(0, m - 1):
tempsum = boardlst[i][j] + boardlst[i][j + 1] + boardlst[i + 1][j] + boardlst[i + 1][j + 1]
if tempsum > largest: largest = tempsum
print(largest)