백준 14531 Bovine Genomics (USACO US Open 2017 Bronze 2번)

문제 링크: https://www.acmicpc.net/problem/14531

14531번: Bovine Genomics (Bronze)

M개의 각각의 자리마다 spotty에 있었던 알파벳이 plain에는 없을때마다 답을 1씩 증가시키면 됨.

#include <bits/stdc++.h>
using namespace std;
 
int N, M, check[200];
char spotty[101][101], plain[101][101];
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    cin >> N >> M;
    for(int i = 0; i < N; i++) for(int j = 0; j < M; j++)
        cin >> spotty[i][j];
    for(int i = 0; i < N; i++) for(int j = 0; j < M; j++)
        cin >> plain[i][j];
 
    int ans = 0;
    for(int j = 0; j < M; j++) {
        memset(check, 0, sizeof(check));
        for(int i = 0; i < N; i++)
            check[spotty[i][j]] = 1;
        int flag = 1;
        for(int i = 0; i < N; i++) {
            if(check[plain[i][j]] != 0) {
                flag = 0;
                break;
            }
        }
        if(flag) ans++;
    }
 
    cout << ans << '\n';
    return 0;
}