comefrom: <qiyuangong>368_Largest_Divisible_Subset_1.py
code: def largestDivisibleSubset( nums):
      S = {-1: set()}
      for x in sorted(nums):
          
          S[x] = max((S[d] for d in S if x % d == 0), key=len) | {x}
      return list(max(S.values(), key=len))
masked: def sample_funcname ( var_0 ) :
      var_1 = { - 1 : set ( ) }
      for var_2 in sorted ( var_0 ) :
          var_1 [ var_2 ] = max ( ( var_1 [ var_4 ] for var_4 in var_1 if var_2 % var_4 == 0 ) , var_3 = len ) | { var_2 }
      return list ( max ( var_1.values ( ) , var_3 = len ) )
  