[백준] #1236 성 지키기

www.acmicpc.net/problem/1236

1236번: 성 지키기

n, m = map(int, input().split(' '))
array = []
row = [0]*n
col = [0]*m
row_cnt = 0
col_cnt = 0
x_cnt = 0
for i in range(n):
    array.append(list(input()))
    for j in range(m):
        if array[i][j] == 'X':
            row[i] = 1
            col[j] = 1
            x_cnt += 1

for i in range(n):
    if row[i] == 0:
        row_cnt += 1
        
for j in range(m):
    if col[j] == 0:
        col_cnt += 1

print(max(row_cnt, col_cnt))