[백준/Python] 숫자 정사각형 - BruteForce

https://www.acmicpc.net/problem/1051

1051번: 숫자 정사각형

 

 

 

Python

import sys
imput = sys.stdin.readline

n, m = map(int, input().split())
arr = [list(map(int, list(input()))) for _ in range(n)]
ans = 1
for i in range(n):
    for j in range(m):
        row, col = [], []
        for t in range(i+1, n):
            if arr[i][j] == arr[t][j]:
                row.append(t)
        for t in range(j+1, m):
            if arr[i][j] == arr[i][t]:
                col.append(t)
        result = []
        for r in row:
            for c in col:
                if (r-i+1 == c-j+1) and arr[r][c] == arr[i][j]:
                    ans = max(ans, (r-i+1)*(c-j+1))
print(ans)

 

 

보완

import sys
imput = sys.stdin.readline

n, m = map(int, input().split())
arr = [list(map(int, list(input()))) for _ in range(n)]
ans = 1

for i in range(n):
    for j in range(m):
        for w in range(1, min(n-i, m-j)):
            if arr[i][j] == arr[i+w][j] == arr[i][j+w] == arr[i+w][j+w]:
                ans = max(ans, (w+1)**2)
print(ans)