From 27ae010fdf2f12e4c7b244a154b50ec7a5a9c91a Mon Sep 17 00:00:00 2001
From: songyc macbook <gitea@gitea>
Date: Sun, 15 Feb 2026 22:26:08 +0900
Subject: [PATCH] baekjoon 20260215

---
 code_study/Baekjoon/c/9466_1.c      | 58 ++++++++++++++++++++++++
 code_study/Baekjoon/c/9466_2.c      | 68 +++++++++++++++++++++++++++++
 code_study/Baekjoon/python/14652.py |  1 +
 3 files changed, 127 insertions(+)
 create mode 100644 code_study/Baekjoon/c/9466_1.c
 create mode 100644 code_study/Baekjoon/c/9466_2.c
 create mode 100644 code_study/Baekjoon/python/14652.py

diff --git a/code_study/Baekjoon/c/9466_1.c b/code_study/Baekjoon/c/9466_1.c
new file mode 100644
index 0000000..4071d66
--- /dev/null
+++ b/code_study/Baekjoon/c/9466_1.c
@@ -0,0 +1,58 @@
+#include <stdio.h>
+#include <stdbool.h>
+
+int T, N, G;
+int select[100001], result[100001];
+bool visited[100001], done[100001];
+
+int solv();
+void dfs(int num);
+
+int main() {
+    scanf("%d", &T);
+
+    for(int t=0; t<T; t++) {
+        G = 0;
+        result[t] = solv();
+    }
+
+    for(int i=0; i<T; i++) printf("%d\n", result[i]);
+
+    return 0;
+}
+
+int solv() {
+    scanf("%d", &N);
+
+    for(int i=1; i<=N; i++) {
+        visited[i] = false;
+        done[i] = false;
+        scanf("%d", &select[i]);
+    }
+
+    for(int n=1; n<=N; n++) {
+        dfs(select[n]);
+    }
+
+    return N - G;
+}
+
+void dfs(int num) {
+    if(done[num]) return;
+
+    visited[num] = true;
+
+    int next = select[num];
+
+    if(!visited[next]) dfs(next);
+    else if(visited[next] && !done[next]) {
+        int temp = 1;
+        while(next != num) {
+            temp++;
+            next = select[next];
+        }
+        G += temp;
+    }
+
+    done[num] = true;
+}
\ No newline at end of file
diff --git a/code_study/Baekjoon/c/9466_2.c b/code_study/Baekjoon/c/9466_2.c
new file mode 100644
index 0000000..c1e2b86
--- /dev/null
+++ b/code_study/Baekjoon/c/9466_2.c
@@ -0,0 +1,68 @@
+#include <stdio.h>
+#include <stdbool.h>
+
+int T, N, G;
+int select[100001], result[100001];
+bool visited[100001], done[100001];
+
+int solv();
+void dfs(int num);
+
+int main() {
+    scanf("%d", &T);
+
+    for(int t=0; t<T; t++) {
+        G = 0;
+        result[t] = solv();
+    }
+
+    for(int i=0; i<T; i++) printf("%d\n", result[i]);
+
+    return 0;
+}
+
+int solv() {
+    scanf("%d", &N);
+
+    for(int i=1; i<=N; i++) {
+        visited[i] = false;
+        done[i] = false;
+        scanf("%d", &select[i]);
+    }
+
+    for(int n=1; n<=N; n++) {
+        if(done[n]) continue;
+        dfs(select[n]);
+    }
+
+    return N - G;
+}
+
+void dfs(int num) {
+    int curr = num;
+
+    while(true) {
+        visited[curr] = true;
+        curr = select[curr];
+
+        if(visited[curr]) {
+            if(!done[curr]) {
+                int temp = 1;
+                int next = select[curr];
+                while(next != curr) {
+                    temp++;
+                    next = select[next];
+                }
+                G += temp;
+            }
+
+            break;
+        }
+    }
+
+    curr = num;
+    while(!done[curr]) {
+        done[curr] = true;
+        curr = select[curr];
+    }
+}
\ No newline at end of file
diff --git a/code_study/Baekjoon/python/14652.py b/code_study/Baekjoon/python/14652.py
new file mode 100644
index 0000000..877e42d
--- /dev/null
+++ b/code_study/Baekjoon/python/14652.py
@@ -0,0 +1 @@
+print(*(lambda x : [x[2]//x[1], x[2]%x[1]])(list(map(int, input().split()))))
\ No newline at end of file