[백준] 11050 python- 이항 계수 1(브론즈 1)

https://www.acmicpc.net/problem/11050

1트

이항 계수(binominal coefficient)

import math

math.factorial()
math.comb(n, k)
math.perm(n, k)

combinations_with_replacement()

# iterable 객체, 뽑고자 하는 수
from itertools import product
from itertools import combinations
from itertools import combinations_with_replacement
from itertools import permutations

#내 풀이

import sys
import math


def binomial_coefficient(n, k):
    factorial = math.factorial
    return factorial(n) // (factorial(n-k) * factorial(k))


n, k = map(int, sys.stdin.readline().rstrip().split())
# print(binomial_coefficient(n, k))
print(math.comb(n, k))