

'''simple docstring'''

def 					__UpperCamelCase				(						lowercase__    :	list			):






     '''simple docstring'''





     __lowercase      		=0
     while len(lowercase__			) > 1:
          __lowercase      		=0
          # Consider two files with minimum cost to be merged
          for _ in range(2			):
               __lowercase      		=files.index(min(lowercase__			)			)
               temp += files[min_index]
               files.pop(lowercase__			)
          files.append(lowercase__			)
          optimal_merge_cost += temp
     return optimal_merge_cost


if __name__ == "__main__":
       import doctest

       doctest.testmod()





'''simple docstring'''

def 					__UpperCamelCase				(						lowercase__    :	List[str],       lowercase__    :	Tuple			):






     '''simple docstring'''





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







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


