• 문제 링크
https://www.acmicpc.net/problem/5947
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int n = read() + 1, nq = read() + 1, p = read();
int[][] mat = new int[n][nq];
for (int i = 1; i < n; i++) for (int j = 1; j < nq; j++) mat[i][j] = read();
Pair[] arr = new Pair[p];
for (int i = 0; i < p; i++) arr[i] = new Pair(read(), read());
int cnt = 0;
for (int i = 1; i < n; i++) {
boolean flag = true;
for (int j = 0; j < p; j++) flag &= mat[i][arr[j].q] == arr[j].a;
if (flag) cnt++;
}
bw.write(String.valueOf(cnt));
bw.flush();
}
private static class Pair {
int q, a;
Pair(int q, int a) {
this.q = q;
this.a = a;
}
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 25643 문자열 탑 쌓기 - Brute Force / Java (0) | 2024.05.27 |
---|---|
[백준] 18141 Are They All Integers? - Brute Force / Java (0) | 2024.05.26 |
[백준] 6013 Lonesome Partners - Brute Force / Java (0) | 2024.05.24 |
[백준] 1907 탄소 화합물 - Brute Force / Java (0) | 2024.05.23 |
[백준] 31000 교환 분배법칙 - Brute Force / Java (0) | 2024.05.22 |
댓글