• 문제 링크
https://www.acmicpc.net/problem/20568
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.HashSet;
import java.util.Set;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
Set<Integer> set = new HashSet<>();
int n = read(), cnt = 0;
while (n-- > 0) if (!set.add(read())) cnt++;
bw.write(String.valueOf(cnt));
bw.flush();
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 28470 슥~빡! 빡~슥! - Greedy / Java (0) | 2025.07.04 |
---|---|
[백준] 29891 체크포인트 달리기 - Greedy / Java (0) | 2025.07.03 |
[백준] 30281 Saldainiai - Greedy / Java (0) | 2025.07.01 |
[백준] 33690 포린드롬 - Brute Force / Java (0) | 2025.06.30 |
[백준] 1526 가장 큰 금민수 - Brute Force / Java (0) | 2025.06.29 |
댓글