def binomialCoeff(n, k):
    """
    Calculate the number of way 'n' things can be chosen 'k' at-a-time,
    'n'-choose-'k'. This is a simple implementation of the
    scipy.special.comb function.

    :param n: (int) The number of things
    :param k: (int) The number of things to be chosen at one time
    :return: (int) The total number of combinations
    """
    if k < 0 or k > n:
        return 0
    if k > n-k:
        k = n-k
    c = 1
    for i in range(k):
        c = c*(n - (k - (i+1)))
        c = c // (i+1)
    return c