
from __future__ import annotations



def 		lowercase_    (     A__	)							->							int:
				"""simple docstring"""

				for i in range(1				,	len(matrix[0]	)	):
								matrix[0][i] += matrix[0][i - 1]

				# preprocessing the first column
				for i in range(1				,	len(A__	)	):
								matrix[i][0] += matrix[i - 1][0]

				# updating the path cost for current position
				for i in range(1				,	len(A__	)	):
								for j in range(1				,	len(matrix[0]	)	):
												matrix[i][j] += min(matrix[i - 1][j]				,	matrix[i][j - 1]	)

				return matrix[-1][-1]


if __name__ == "__main__":
			import doctest

			doctest.testmod()



def 		lowercase_    (     A__				,	A__	)							->							List[Any]:
    """simple docstring"""

    snake_case				  =      [0 for i in range(r + 1	)]
    # nc0 = 1
    snake_case				  =      1
    for i in range(1				,	n + 1	):
        # to compute current row from previous row.
        snake_case				  =      min(A__				,	A__	)
        while j > 0:
            c[j] += c[j - 1]
            j -= 1
    return c[r]





print(binomial_coefficient(n=10, r=5))

