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_1 : List [ int ] ) -> int :
      var_2 , var_3 = 1 , int ( 1e5 )
      while var_2 < var_3 :
          var_4 = ( var_2 + var_3 ) >> 1
          var_6 = sum ( [ ( var_5 + var_4 - 1 ) // var_4 for var_5 in var_1 ] )
          if var_6 <= var_0 :
              var_3 = var_4
          else :
              var_2 = var_4 + 1
      return var_2
  