백준 12115번 Baza

백준 12115번 Baza

#include <iostream>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
 
int n, m,q;
int DB[1001][1001];
int Q[1001][1001];
 
int Match(int num) {
    int cnt = 0;
    
    for (int i = 0; i < n; i++) {
        bool Check = 1;
        for (int j = 0; j < m; j++) {
            if (Q[num][j] == -1) continue;
            if (Q[num][j] != DB[i][j]) Check = 0;
        }
        if (Check) cnt++;
    }
    return cnt;
}
 
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 >> DB[i][j];
        }
    cin >> q;
    for (int i = 0; i < q; i++)
        for (int j = 0; j < m; j++)
            cin >> Q[i][j];
    
    for (int i = 0; i < q; i++) {
 
        cout << Match(i) << endl;
    }
 
 
 
    return 0;
 
}

출처:https://www.acmicpc.net/problem/12115

COCI연습문제 A번이라난이도는 쉬운편. 단순 구현문제였습니다.