Python/백준

[11057] 오르막 수

류경혜 2022. 5. 23. 13:40

n = int(input())
MOD = 10007
dp = [[0 for _ in range(10)] for _ in range(n+1)]
for i in range(10):
    dp[1][i] = 1
for i in range(2, n+1):
    for j in range(10):
        for k in range(j, 10):
            dp[i][j] += dp[i-1][k]
            print(sum(dp[n]) % MOD)