1969 DNA

#include <stdio.h>
 
int check[55][10] = { 0 };
int dist[1005][55] = { 0 };
 
int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    
    for (int i = 0; i < n; i++) {
        char str[55] = { 0 };
        scanf("%s", &str);
        getchar();
 
        for (int j = 0; j < m; j++) {
            switch(str[j]) {
            case 'A':
                check[j][1]++;
                dist[i][j] = 1;
                break;
            case 'T':
                dist[i][j] = 4;
                check[j][4]++;
                break;
            case 'G':
                dist[i][j] = 3;
                check[j][3]++;
                break;
            case 'C':
                dist[i][j] = 2;
                check[j][2]++;
                break;                
            }
        }
    }
 
    int maxA[55] = { 0 };
    for (int i = 0; i < m; i++) {
        int max = 0, alpha = 0;
        for (int j = 1; j <= 4; j++) {
            if (max < check[i][j]) {
                max = check[i][j];
                alpha = j;
            }
        }
        maxA[i] = alpha;
 
        switch (alpha) {
        case 1: printf("A");
            break;
        case 2: printf("C");
            break;
        case 3: printf("G");
            break;
        case 4: printf("T");
            break;
        }
    }
 
    int rst = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (maxA[j] != dist[i][j])
                rst++;
        }
    }
    printf("\n%d", rst);
}