

'''simple docstring'''







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


if __name__ == "__main__":
      import doctest

      doctest.testmod()






'''simple docstring'''







def  UpperCAmelCase__      ( UpperCAmelCase__			)     ->     float:

       if edge <= 0 or not isinstance(UpperCAmelCase__,    UpperCAmelCase__			):
              raise ValueError("""Length must be a positive."""			)
       return 3 * ((25 + 10 * (5 ** (1 / 2))) ** (1 / 2)) * (edge**2)
def  UpperCAmelCase__      ( UpperCAmelCase__			)     ->     float:

       if edge <= 0 or not isinstance(UpperCAmelCase__,    UpperCAmelCase__			):
              raise ValueError("""Length must be a positive."""			)
       return ((15 + (7 * (5 ** (1 / 2)))) / 4) * (edge**3)


if __name__ == "__main__":
      import doctest

      doctest.testmod()
