백준 2225 파이썬 (합분해)

문제 : https://www.acmicpc.net/problem/2225

💻 Code

import sys
input = sys.stdin.readline

n, k = map(int,input().split())
dp = [[0] * 201 for _ in range(201)]

for i in range(201):
    dp[1][i] = 1
    dp[2][i] = i+1

for i in range(3, 201):
    dp[i][1] = i
    for j in range(2, 201):
        dp[i][j] = (dp[i-1][j] + dp[i][j-1]) % 1000000000

print(dp[k][n])

• k=3 일 때
  n=2 -> (0,0,2) (0,2,0), (2,0,0) (0,1,1) (1,0,1) (1,1,0) 6개
  n=3 -> (0,0,3) (0,3,0) (3,0,0) (0,1,2) (0,2,1) (1,0,2) (1,2,0) (2,0,1) (2,1,0) (1,1,1) 10개

• for문 범위 잘 모르겠으면 최대범위로 하자
• 최소 3x3 표를 그려서 규칙을 찾아보자