Merge pull request #189 from AlgorithmStudy-Allumbus/YoonYn9915

YoonYn9915 / 4월 2주차 / 3문제

Author: YoonYn9915

YoonYn9915/dp/2025-04-12-[백준]-#1562-계단 수.py

@@ -0,0 +1,26 @@
+import sys
+
+input = sys.stdin.readline
+
+N = int(input())
+dp = [[[0 for _ in range(1 << 10)] for _ in range(10)] for _ in range(N)]
+mod = 1000000000
+res = 0
+
+for k in range(1, 10):
+    dp[0][k][1 << k] = 1
+
+for i in range(1, N):
+    for k in range(10):
+        for bit in range(1024):
+            if k - 1 >= 0:
+                dp[i][k][bit | (1 << k)] += dp[i - 1][k - 1][bit]
+            if k + 1 <= 9:
+                dp[i][k][bit | (1 << k)] += dp[i - 1][k + 1][bit]
+            dp[i][k][bit | (1 << k)] %= mod
+
+for k in range(10):
+    res += dp[N - 1][k][1023]
+    res %= mod
+
+print(res)