Merge pull request #1996 from AlgorithmWithGod/JHLEE325

[20260306] BOJ / G3 / 선물 전달 / 이준희

Author: ShinHeeEul

JHLEE325/202603/04 BOJ G3 개미굴.md

@@ -0,0 +1,43 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static class Node {
+        Map<String, Node> children = new TreeMap<>();
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int N = Integer.parseInt(br.readLine());
+
+        Node root = new Node();
+
+        for (int i = 0; i < N; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            int K = Integer.parseInt(st.nextToken());
+
+            Node current = root;
+            for (int j = 0; j < K; j++) {
+                String food = st.nextToken();
+                current.children.putIfAbsent(food, new Node());
+                current = current.children.get(food);
+            }
+        }
+
+        print(root, 0);
+    }
+
+    static void print(Node node, int d) {
+        for (String key : node.children.keySet()) {
+            for (int i = 0; i < d; i++) {
+                System.out.print("--");
+            }
+            System.out.println(key);
+
+            print(node.children.get(key), d + 1);
+        }
+    }
+}
+```

JHLEE325/202603/06 BOJ G3 선물 전달.md

@@ -0,0 +1,32 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int N = Integer.parseInt(br.readLine());
+
+        if (N == 1) {
+            System.out.println(0);
+            return;
+        }
+        if (N == 2) {
+            System.out.println(1);
+            return;
+        }
+
+        long[] dp = new long[N + 1];
+        long mod = 1000000000;
+
+        dp[1] = 0;
+        dp[2] = 1;
+
+        for (int i = 3; i <= N; i++) {
+            dp[i] = (i - 1) * (dp[i - 1] + dp[i - 2]) % mod;
+        }
+
+        System.out.println(dp[N]);
+    }
+}
+```