

"""simple docstring"""



def  _snake_case     (    UpperCAmelCase_  :					int			):
     A__										=  [1]

     A__			,				A__			,				A__										=  0, 0, 0
     A__										=  ugly_nums[ia] * 2
     A__										=  ugly_nums[ia] * 3
     A__										=  ugly_nums[ia] * 5

     for _ in range(1					,   UpperCAmelCase_			):
          A__										=  min(UpperCAmelCase_					,   UpperCAmelCase_					,   UpperCAmelCase_			)
          ugly_nums.append(UpperCAmelCase_			)
          if next_num == next_a:
               ia += 1
               A__										=  ugly_nums[ia] * 2
          if next_num == next_a:
               ia += 1
               A__										=  ugly_nums[ia] * 3
          if next_num == next_a:
               ia += 1
               A__										=  ugly_nums[ia] * 5
     return ugly_nums[-1]


if __name__ == "__main__":
 from doctest import testmod

 testmod(verbose=True)
 print(f"""{ugly_numbers(2_0_0) = }""")









"""simple docstring"""



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

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






