// DRUNKWATER TEMPLATE(add description and prototypes)
// Question Title and Description on leetcode.com
// Function Declaration and Function Prototypes on leetcode.com
//368. Largest Divisible Subset
//Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0.
//If there are multiple solutions, return any subset is fine.
//Example 1:
//nums: [1,2,3]
//Result: [1,2] (of course, [1,3] will also be ok)
//Example 2:
//nums: [1,2,4,8]
//Result: [1,2,4,8]
//Credits:
//Special thanks to @Stomach_ache for adding this problem and creating all test cases.
//class Solution {
//    func largestDivisibleSubset(_ nums: [Int]) -> [Int] {
//    }
//}



// Time Is Money