From 8b0838cf5608a7738982257af03be22ccdae02f2 Mon Sep 17 00:00:00 2001
From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com>
Date: Thu, 6 Nov 2025 10:04:52 +0900
Subject: [PATCH] =?UTF-8?q?[20251106]=20BOJ=20/=20G1=20/=20=EA=B3=84?=
 =?UTF-8?q?=EB=8B=A8=20=EC=88=98=20/=20=ED=95=9C=EC=A2=85=EC=9A=B1?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ... \352\263\204\353\213\250 \354\210\230.md" | 50 +++++++++++++++++++
 1 file changed, 50 insertions(+)
 create mode 100644 "Ukj0ng/202511/06 BOJ G1 \352\263\204\353\213\250 \354\210\230.md"

diff --git "a/Ukj0ng/202511/06 BOJ G1 \352\263\204\353\213\250 \354\210\230.md" "b/Ukj0ng/202511/06 BOJ G1 \352\263\204\353\213\250 \354\210\230.md"
new file mode 100644
index 00000000..94845b9e
--- /dev/null
+++ "b/Ukj0ng/202511/06 BOJ G1 \352\263\204\353\213\250 \354\210\230.md"	
@@ -0,0 +1,50 @@
+```
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static final int MOD = 1000000000;
+    private static int[][][] dp;
+    private static int N;
+    public static void main(String[] args) throws IOException {
+        init();
+        long answer = 0;
+        for (int i = 0; i < 10; i++) {
+            answer += dp[N][i][(1<<10) - 1];
+            answer %= MOD;
+        }
+
+        bw.write(answer + "\n");
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        N = Integer.parseInt(br.readLine());
+
+        dp = new int[N+1][10][1<<10];
+
+        for (int i = 1; i < 10; i++) {
+            dp[1][i][1<<i] = 1;
+        }
+
+        for (int i = 2; i <= N; i++) {
+            for (int j = 0; j < 10; j++) {
+                for (int k = 0; k < 1<<10; k++) {
+                    if (j < 9) {
+                        dp[i][j+1][k | (1<<(j+1))] += dp[i-1][j][k];
+                        dp[i][j+1][k | (1<<(j+1))] %= MOD;
+                    }
+                    if (j > 0) {
+                        dp[i][j-1][k | (1<<(j-1))] += dp[i-1][j][k];
+                        dp[i][j-1][k | (1<<(j-1))] %= MOD;
+                    }
+                }
+            }
+        }
+    }
+}
+```