SWEA-회문2(1216)


SWEA-회문2(1216)

for tc in range(1,11): T = int(input()) arr = [input() for _ in range(100)] result = '' max_num = 0 N = 100 for i in range(N): M = 100 while M > 0: for j in range(N-M+1): for k in range(M//2): if arr[i][j+k] != arr[i][j+M-k-1]: break else: result = '' for x in range(M): result += arr[i][j+x] if max_num < len(result): max_num = len(result) M -= 1 for i in range(N): M = 100 while M > 0: for j in range(N-M+1): for k in range(M//2): if arr[j+k][i] != arr[j+M-k-1][i]: break else: result = '' for x in...


#1216 #SWEA #문제풀이 #알고리즘 #회문2

원문링크 : SWEA-회문2(1216)