• 문제 링크
https://www.acmicpc.net/problem/30611
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
Set<String> set = new HashSet<>();
int m = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());
while (m-- > 0) set.add(st.nextToken());
int n = Integer.parseInt(br.readLine());
st = new StringTokenizer(br.readLine());
while (n-- > 0) if (!set.contains(st.nextToken())) break;
bw.write(n < 0 ? "1" : "0");
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 10432 데이터 스트림의 섬 - Brute Force / Java (0) | 2025.01.06 |
---|---|
[백준] 30891 볶음밥 지키기 - Brute Force / Java (0) | 2025.01.05 |
[백준] 27042 Bonbons - Data Structure / Java (0) | 2025.01.03 |
[백준] 11344 Waiting for Change - Data Structure / Java (0) | 2025.01.02 |
[백준] 29779 Colliding Encoding - Data Structure / Java (0) | 2025.01.01 |
댓글