<doocs>1283.Find the Smallest Divisor Given a Threshold_1.py
def smallestDivisor( nums: List[int], threshold: int) -> int:
    left, right = 1, 10**6
    while left < right:
        mid = (left + right) >> 1
        s = sum((v + mid - 1) // mid for v in nums)
        if s <= threshold:
            right = mid
        else:
            left = mid + 1
    return left
def sample_funcname ( var_0 : List [ int ] , var_3 : int ) -> int :
    var_5 , var_8 = 1 , 10 ** 6
    while var_5 < var_8 :
        var_9 = ( var_5 + var_8 ) >> 1
        var_12 = sum ( ( var_11 + var_9 - 1 ) // var_9 for var_11 in var_0 )
        if var_12 <= var_3 :
            var_8 = var_9
        else :
            var_5 = var_9 + 1
    return var_5
