• 문제 링크
https://www.acmicpc.net/problem/24081
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.HashSet;
import java.util.Set;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int[] arr = new int[read()];
int m = read();
for (int i = 0; i < arr.length; i++) arr[i] = read();
Set<Integer> set = new HashSet<>();
while (m-- > 0) set.add(read());
int cnt = 0;
for (int i : arr) if (set.contains(i)) cnt++;
bw.write(String.valueOf(cnt));
bw.flush();
}
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' 카테고리의 다른 글
[백준] 5533 유니크 - Implementation / Java (0) | 2025.04.21 |
---|---|
[백준] 4493 가위 바위 보? - Implementation / Java (0) | 2025.04.20 |
[백준] 33164 どら焼き (Dorayaki) - Brute Force / Java (0) | 2025.04.18 |
[백준] 21180 Reconstruct Sum - Brute Force / Java (0) | 2025.04.17 |
[백준] 14472 休憩スペース (Refreshment Area) - Brute Force / Java (0) | 2025.04.16 |
댓글