• 문제 링크
5089번: Travelling Salesman
Output consists of a single line for each week. It contains the word Week, followed by a space, followed by the week number, the first week being 1, followed by a space, followed by the actual number of towns to be visited, duplicates having been removed.
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.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));
StringBuilder sb = new StringBuilder();
Set<String> set = new HashSet<>();
int t = 0, n;
while ((n = Integer.parseInt(br.readLine())) != 0) {
while (n-- > 0) set.add(br.readLine());
sb.append("Week ").append(++t).append(" ").append(set.size()).append("\n");
set.clear();
}
bw.write(sb.toString());
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 16815 Star in Parentheses - Data Structure / Java (0) | 2023.09.10 |
---|---|
[백준] 18679 Banana - Data Structure / Java (0) | 2023.09.09 |
[백준] 15098 No Duplicates - Data Structure / Java (0) | 2023.09.07 |
[백준] 6159 Costume Party - Brute Force / Java (0) | 2023.09.06 |
[백준] 15721 번데기 - Brute Force / Java (0) | 2023.09.05 |
댓글