1. BOJ 10844 쉬운계단수 실버 1, DP https://www.acmicpc.net/problem/10844 코드 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 N = int(input()) dp = [] for i in range(N): dp.append([0 for _ in range(10)]) dp[0] = [0, 1, 1, 1, 1, 1, 1, 1, 1, 1] if N>=2: for i in range(1, N): for j in range(10): if j==0: dp[i][j] = dp[i-1][j+1] elif j==9: dp[i][j] = dp[i-1][j-1] else: dp[i][j] = dp[i-1][j-1] + dp[i-1][j+1] ans..
