

'''simple docstring'''

import re

from filelock import FileLock


try:
    import nltk

    A_       						=							True
except (ImportError, ModuleNotFoundError):
    A_       						=							False

if NLTK_AVAILABLE:
    with FileLock(".lock") as lock:
        nltk.download("punkt", quiet=True)


def    A_  ( snake_case ):
  re.sub("<n>"      ,       ""      ,       snake_case )  # remove pegasus newline char
  assert NLTK_AVAILABLE, "nltk must be installed to separate newlines between sentences. (pip install nltk)"
  return "\n".join(nltk.sent_tokenize(snake_case ) )









'''simple docstring'''

from math import factorial





def    A_  ( snake_case      ,       snake_case ):

  # If either of the conditions are true, the function is being asked
  # to calculate a factorial of a negative number, which is not possible
  if n < k or k < 0:
    raise ValueError("Please enter positive integers for n and k where n >= k" )
  return factorial(snake_case ) // (factorial(snake_case ) * factorial(n - k ))


if __name__ == "__main__":
    print(
        "The number of five-card hands possible from a standard",
        f'''fifty-two card deck is: {combinations(52, 5)}\n''',
    )

    print(
        "If a class of 40 students must be arranged into groups of",
        f'''4 for group projects, there are {combinations(40, 4)} ways''',
        "to arrange them.\n",
    )

    print(
        "If 10 teams are competing in a Formula One race, there",
        f'''are {combinations(10, 3)} ways that first, second and''',
        "third place can be awarded.",
    )






