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_3 = { - 1 : set ( ) }
      for var_5 in sorted ( var_0 ) :
          var_3 [ var_5 ] = max ( ( var_3 [ var_8 ] for var_8 in var_3 if var_5 % var_8 == 0 ) , var_6 = len ) | { var_5 }
      return list ( max ( var_3.values ( ) , var_6 = len ) )
  