• 문제 링크
https://www.acmicpc.net/problem/1453
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
boolean[] arr = new boolean[101];
int n = read(), cnt = 0;
while (n-- > 0) {
int i = read();
if (arr[i]) cnt++;
else arr[i] = true;
}
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' 카테고리의 다른 글
[백준] 33093 Golden Tickets - Data Structure / Java (0) | 2025.02.23 |
---|---|
[백준] 32978 아 맞다 마늘 - Data Structure / Java (0) | 2025.02.22 |
[백준] 2108 통계학 - Implementation / Java (0) | 2025.02.20 |
[백준] 2607 비슷한 단어 - Implementation / Java (0) | 2025.02.19 |
[백준] 5217 쌍의 합 - Implementation / Java (0) | 2025.02.18 |
댓글