[BOJ] 쉬운 계단 수 / 실버 1 / 100분 힌트 사용

https://www.acmicpc.net/problem/10844

Author: YoonYn9915

YoonYn9915/dp/2025-04-10-[백준]-#10844-쉬운 계단 수.py

@@ -0,0 +1,19 @@
+
+N = int(input())
+
+dp = [[0] * 10 for _ in range(N + 1)]
+
+for i in range(1, 10):
+    dp[1][i] = 1
+
+for i in range(2, N + 1):
+    for j in range(10):
+        if j == 0:
+            dp[i][j] = dp[i - 1][1]
+        elif 1 <= j <= 8:
+            dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j + 1]
+        else:
+            dp[i][j] = dp[i - 1][8]
+
+
+print(sum(dp[N]) % 1000000000)