• 문제 링크
https://www.acmicpc.net/problem/23544
• 풀이 코드
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());
        for (int i = 0; i < n; i++) set.add(br.readLine());
        bw.write(String.valueOf(n - set.size()));
        bw.flush();
    }
}'Problem Solving > Baekjoon' 카테고리의 다른 글
| [백준] 11518 Morse - Data Structure / Java (0) | 2024.06.25 | 
|---|---|
| [백준] 15088 Game of Throwns - Data Structure / Java (0) | 2024.06.24 | 
| [백준] 8620 Hurtownia - Data Structure / Java (0) | 2024.06.22 | 
| [백준] 6149 Card Stacking - Data Structure / Java (0) | 2024.06.21 | 
| [백준] 8783 Architektura niezależna - Graph Theory / Java (0) | 2024.06.20 | 
 
										
									 
										
									 
										
									 
										
									
댓글