[BaekJoon][1236] 성 지키기

BAEKJOON ONLINE JUDGE

1236번 성 지키기

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

#include <stdio.h>
 
int max(int first, int second)
{
    if (first > second)    return first;
    return second;
}
 
int main()
{
    int n, m;
    int i, j;
    char map[51][51];
    int wcnt = 0, hcnt = 0;
 
    scanf("%d %d", &n, &m);
 
    for (i = 0; i < n; i++) {
        scanf("%s", map[i]);
        
        for (j = 0; j < m; j++) {
            if (map[i][j] == 'X') {
                hcnt++;
                break;
            }
        }
    }
    
    for (j = 0; j < m; j++) {
        for (i = 0; i < n; i++) {
            if (map[i][j] == 'X') {
                wcnt++;
                break;
            }
        }
    }
 
    hcnt = n - hcnt;
    wcnt = m - wcnt;
 
    printf("%d\n", max(wcnt, hcnt));
 
    return 0;
}