[Python] 백준 2407번 - 조합

 

 

 

<코드>

n, m = map(int,input().split())
n = int(n)
m = int(m)

dp = [[0]*101 for i in range(101)]

for i in range(n + 1):
    for j in range(i + 1):
        if j == 0:
            dp[i][j] = 1;
        elif j == i:
            dp[i][j] = 1;
        else:
            dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j];

print(dp[n][m])

 

 

 

www.acmicpc.net/problem/2407

2407번: 조합