• 문제 링크
https://www.acmicpc.net/problem/29881
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.util.Map;
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));
StringBuilder sb = new StringBuilder();
Map<String, String> map = new HashMap<>();
int n = Integer.parseInt(br.readLine());
for (int i = 0; i < n; i++) {
String[] arr = br.readLine().split(" ");
map.put(arr[0], arr[1]);
}
while (n-- > 0) {
String[] arr = br.readLine().split(" ");
sb.append(map.get(arr[0])).append(" ").append(arr[1]).append("\n");
}
bw.write(sb.toString());
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 31047 Warehouse - Data Structure / Java (0) | 2024.10.06 |
---|---|
[백준] 6296 Crazy Search - Data Structure / Java (0) | 2024.10.05 |
[백준] 32307 Injured Shoulder - Data Structure / Java (0) | 2024.10.03 |
[백준] 31908 커플링 매치 - Data Structure / Java (0) | 2024.10.02 |
[백준] 29847 Character Frequencies - Data Structure / Java (0) | 2024.10.01 |
댓글