• 문제 링크
https://www.acmicpc.net/problem/29934
• 풀이 코드
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;
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 n = Integer.parseInt(br.readLine());
while (n-- > 0) set.add(br.readLine());
int m = Integer.parseInt(br.readLine());
while (m-- > 0) if (set.contains(br.readLine())) n++;
bw.write(String.valueOf(n + 1));
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 1100 하얀 칸 - Implementation / Java (0) | 2024.08.26 |
---|---|
[백준] 30068 Stovėjimo aikštelė - Data Structure / Java (0) | 2024.08.25 |
[백준] 10489 Even Up Solitaire - Data Structure / Java (0) | 2024.08.23 |
[백준] 8538 Bałagan i Stonki - Data Structure / Java (0) | 2024.08.22 |
[백준] 13650 Botas perdidas - Data Structure / Java (0) | 2024.08.21 |
댓글