https://www.acmicpc.net/problem/2776
set contains 판별
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
int T = Integer.parseInt(br.readLine());
for (int i = 0; i < T; i++) {
Set<Integer> s = new HashSet<>();
br.readLine();
Arrays.stream(br.readLine().split(" ")).mapToInt(Integer::parseInt).forEach(s::add);
br.readLine();
Arrays.stream(br.readLine().split(" "))
.mapToInt(Integer::parseInt)
.map(n -> s.contains(n) ? 1 : 0)
.forEach(n -> sb.append(n).append("\n"));
}
System.out.println(sb);
}
}
'[백준] PS > Java [실랜디]' 카테고리의 다른 글
[백준 10384] 팬그램 - JAVA (0) | 2025.03.13 |
---|---|
[백준 2670] 연속부분최대곱 - JAVA (0) | 2025.03.13 |
[백준 2659] 십자카드 문제 - JAVA (0) | 2025.03.12 |
[백준 2161] 카드1 - JAVA (0) | 2025.03.11 |
[백준 2535] 아시아 정보올림피아드 - JAVA (0) | 2025.03.10 |