



'''simple docstring'''





def 			lowerCAmelCase__	(					lowerCamelCase_	:	Any ,lowerCamelCase_	:	Optional[Any]):





				'''simple docstring'''

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

print(binomial_coefficient(n=1_0, r=5))






from __future__ import annotations






def 			lowerCAmelCase__	(					lowerCamelCase_	:	int):





				'''simple docstring'''

				lowerCAmelCase__  :       Optional[int]				=  str(lowerCamelCase_)
				return len(lowerCamelCase_) == 9 and set(lowerCamelCase_) == set('''123456789''')






def 			lowerCAmelCase__	(					):





				'''simple docstring'''

				for base_num in range(9999 ,4999 ,-1):
								lowerCAmelCase__  :       Union[str, Any]				=  100002 * base_num
								if is_9_pandigital(lowerCamelCase_):
												return candidate

				for base_num in range(333 ,99 ,-1):
								lowerCAmelCase__  :       Any				=  1002003 * base_num
								if is_9_pandigital(lowerCamelCase_):
												return candidate

				return None


if __name__ == "__main__":
							print(f"""{solution() = }""")

