<qiyuangong>368_Largest_Divisible_Subset_2.py
def largestDivisibleSubset( nums):
    ls = len(nums)
    S = {-1: set()}
    for num in sorted(nums):
        candicate = []
        for key in S:
            if num % key == 0:
                candicate.append(S[key])
        S[num] = max(candicate, key=len) | {num}
    return
def sample_funcname ( var_0 ) :
    var_2 = len ( var_0 )
    var_5 = { - 1 : set ( ) }
    for var_7 in sorted ( var_0 ) :
        var_8 = [ ]
        for var_9 in var_5 :
            if var_7 % var_9 == 0 :
                var_8.append ( var_5 [ var_9 ] )
        var_5 [ var_7 ] = max ( var_8 , var_9 = len ) | { var_7 }
    return
