[python] 백준 1051 숫자 정사각형

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

1051번: 숫자 정사각형

m, n = map(int, input().split())
mn = min(m, n)

a = []
for _ in range(m):
    a.append(list(input()))
    
def func():
    for k in range(mn-1, 0, -1):  # k : 변의 길이
        for j in range(m-k):
            for i in range(n-k):
                if a[j][i] == a[j][k+i] and a[j][k+i] == a[j+k][i] and a[j+k][i] == a[j+k][k+i]:
                    print((k+1)*(k+1))
                    return
                    
    if result == 0:
        print(1)
        return
        
func()