• 문제 링크
https://www.acmicpc.net/problem/8636
• 풀이 코드
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));
int[] arr = new int[read() + 1];
for (int i = 1; i < arr.length; i++) arr[i] = read();
int cnt = 0, i = 1;
while (i < arr.length) {
if (arr[i] == 0) i++;
else {
while (arr[i] != 0) {
int tmp = arr[i];
arr[i] = 0;
i = tmp;
}
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' 카테고리의 다른 글
[백준] 25775 Letter Frequency - Data Structure / Java (0) | 2024.07.21 |
---|---|
[백준] 7534 Scavenger Hunt - Graph Theory / Java (1) | 2024.07.20 |
[백준] 12050 Dynamic Grid (Small), 12051 Dynamic Grid (Large) - Graph Theory / Java (0) | 2024.07.18 |
[백준] 21325 Free food - Graph Theory / Java (0) | 2024.07.17 |
[백준] 4131 Modulo Solitaire - Graph Theory / Java (0) | 2024.07.16 |
댓글