Re-translate the Japanese version (#1871)

* Retranslate Japanese docs with GPT-5.4

* Retranslate Japanese code with GPT-5.4

ja/codes/c/chapter_dynamic_programming/climbing_stairs_dfs.c

@@ -0,0 +1,32 @@
+/**
+ * File: climbing_stairs_dfs.c
+ * Created Time: 2023-09-19
+ * Author: huawuque404 (huawuque404@163.com)
+ */
+
+#include "../utils/common.h"
+
+/* 検索 */
+int dfs(int i) {
+    // dp[1] と dp[2] は既知なので返す
+    if (i == 1 || i == 2)
+        return i;
+    // dp[i] = dp[i-1] + dp[i-2]
+    int count = dfs(i - 1) + dfs(i - 2);
+    return count;
+}
+
+/* 階段登り：探索 */
+int climbingStairsDFS(int n) {
+    return dfs(n);
+}
+
+/* Driver Code */
+int main() {
+    int n = 9;
+
+    int res = climbingStairsDFS(n);
+    printf("%d 段の階段を登る方法は全部で %d 通りです\n", n, res);
+
+    return 0;
+}