(Python) 백준 2775 / 부녀회장이 될테야

풀이

최대 입력개수가 1 ~ 14여서 간단하게 풀수있었다

# 
# 1,  6,  21,   56
# 1,  5,  15,   35,   70,   126
# 1,  4,  10,   20,   35,   56
# 1,  3,  6,    10,   15,   21
# 1,  2,  3,    4,    5,    6

import sys

temp = [[] for _ in range(15)]

temp[0] = [i for i in range(15)]

for i in range(1, 15):
  for n in range( 15):
    temp[i].append(0)

for i in range(1, 15):
  for n in range(1, 15):
    temp[i][n] = sum(temp[i - 1][1:n + 1])
      
pass
      
input = sys.stdin.readline

a = int(input())

for _ in range(a):
  k = int(input())
  n = int(input())
  
  print(temp[k][n])