백준 11051 - 이항 계수 2 (파이썬)

Answer

n, k = map(int, input().split())
dp = []

for i in range(1, n + 2) :
    dp.append([1] * i)

for i in range(2, n + 1) :
    for j in range(1, i) :
        dp[i][j] = (dp[i-1][j-1] + dp[i-1][j]) % 10007

print(dp[n][k])