• 문제 링크
https://www.acmicpc.net/problem/15081
• 풀이 코드
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 {
static Set<String> set = new HashSet<>();
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();
int n = Integer.parseInt(br.readLine());
while (n-- > 0) sb.append(choose(br.readLine())).append(" ");
bw.write(sb.toString());
bw.flush();
}
private static String choose(String s) {
StringTokenizer st = new StringTokenizer(s);
int m = Integer.parseInt(st.nextToken());
while (m-- > 0) if (set.add(s = st.nextToken())) return s;
return s;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 10204 Neighborhoods in Graphs - Graph Theory / Java (0) | 2024.05.05 |
---|---|
[백준] 27100 Stamps - Graph Theory / Java (0) | 2024.05.04 |
[백준] 10689 Hamza - Data Structure / Java (0) | 2024.05.02 |
[백준] 5263 samba - Data Structure / Java (0) | 2024.05.01 |
[백준] 4775 Spelling Be - Data Structure / Java (0) | 2024.04.30 |
댓글