[已解决]Python：每日一题 336

whosyourdaddy

def func336(m,woods):
    woods.sort()
    length = 1
    result = 0
    while length < woods[-1]:
        num = 0
        for each in woods:
            num += each // length
        if num >= m:
            result = length
        length += 1
    return result