• 문제 링크
18679번: Banana
The first line of input will contain a single integer N, the number of words in the dictionary (1 ≤ N ≤ 100). The following N lines will each contain a sentence of the format x = y where x is an English word and y is a Minionese word. The next line wil
www.acmicpc.net
• 풀이 코드
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;
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));
StringBuilder sb = new StringBuilder();
Map<String, String> map = new HashMap<>();
int n = Integer.parseInt(br.readLine());
while (n-- > 0) {
String[] arr = br.readLine().split(" = ");
map.put(arr[0], arr[1]);
}
int t = Integer.parseInt(br.readLine());
while (t-- > 0) {
int k = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());
while (k-- > 0) sb.append(map.get(st.nextToken())).append(" ");
sb.append("\n");
}
bw.write(sb.toString());
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 11235 Polling - Data Structure / Java (0) | 2023.09.11 |
---|---|
[백준] 16815 Star in Parentheses - Data Structure / Java (0) | 2023.09.10 |
[백준] 5089 Travelling Salesman - Data Structure / Java (0) | 2023.09.08 |
[백준] 15098 No Duplicates - Data Structure / Java (0) | 2023.09.07 |
[백준] 6159 Costume Party - Brute Force / Java (0) | 2023.09.06 |
댓글