[백준_10844] 쉬운 계단 수 python

dp구현과정

dp = [0 for _ in range(101)]

for i in range(101):

　dp[i] = [0 for _ in range(10)]

for i in range(1,10):

　dp[1][i] = 1

for i in range(2, 101):

　for j in range(10):

　　if j == 0:

　　　dp[i][j] = dp[i-1][1]

　　elif j == 9:

　　　dp[i][j] = dp[i-1][8]

　　else:

　　　dp[i][j] = (dp[i-1][j-1] + dp[i-1][j+1])

n = int(input())

print(sum(dp[n]) % 1000000000)