[2022.02.17]
T = int(input())
def check(board):
for i in range(N):
for j in range(N-M+1):
tmp = board[i][j:j+M]
if tmp == tmp[::-1]:
print(f'#{tc+1} :{tmp}')
return 1
for tc in range(T):
N,M = map(int,input().split())
board = [input() for _ in range(N)]
if check(board): continue
else:
vboard = ['' for _ in range(N)]
for i in range(N):
for j in range(N):
vboard[i] += board[j][i]
check(vboard)
'코딩테스트 > SWExpertAcademy' 카테고리의 다른 글
[Python] SWEA 13761 - 가장 빠른 문자열 타이핑 (0) | 2022.04.13 |
---|---|
[Python] SWEA 13760 - 쇠막대기 자르기 (0) | 2022.04.13 |
[Python] SWEA 4865 - 글자수 (0) | 2022.04.13 |
[Python] SWEA 4864 - 문자열비교 (0) | 2022.04.13 |
[Python] SWEA 1221 - GNS (0) | 2022.04.13 |
댓글