N, M = map(int, input().split())arr= [[0 for _ in range(M)] for _ in range(N)] # 2차원 배열 for i in range(N): temp = list(map(int, input().strip())) for j in range(M): arr[i][j] = temp[j]final = 1max_len = min(N, M) # 정사각형의 최대 길이 (둘 중 더 짧은 것)for length in range(1, max_len): for i in range(N-length): for j in range(M-length): a = arr[i][j] b = arr[i + len..
