






"""simple docstring"""


def        UpperCAmelCase      (					a__     ,      a__ ):





						'''simple docstring'''






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







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







"""simple docstring"""


from math import loga


def        UpperCAmelCase      (					a__ ):





						'''simple docstring'''






						if a < 0:
												raise ValueError('Input value must be a positive integer' )
						elif isinstance(a__     ,      a__ ):
												raise TypeError('Input value must be a \'int\' type' )
						return 0 if (a == 0) else int(loga(a & -a ) )


if __name__ == "__main__":
		import doctest

		doctest.testmod()