comefrom: <doocs>2064.Minimized Maximum of Products Distributed to Any Store_1.py
code: def minimizedMaximum( n: int, quantities: List[int]) -> int:
      left, right = 1, int(1e5)
      while left < right:
          mid = (left + right) >> 1
          s = sum([(q + mid - 1) // mid for q in quantities])
          if s <= n:
              right = mid
          else:
              left = mid + 1
      return left
masked: def sample_funcname ( var_0 : int , var_2 : List [ int ] ) -> int :
      var_5 , var_7 = 1 , int ( 1e5 )
      while var_5 < var_7 :
          var_8 = ( var_5 + var_7 ) >> 1
          var_11 = sum ( [ ( var_10 + var_8 - 1 ) // var_8 for var_10 in var_2 ] )
          if var_11 <= var_0 :
              var_7 = var_8
          else :
              var_5 = var_8 + 1
      return var_5
  