<p>Given a set of <strong>distinct</strong> positive integers <code>nums</code>, return the largest subset <code>answer</code> such that every pair <code>(answer[i], answer[j])</code> of elements in this subset satisfies:</p>

<ul>
	<li><code>answer[i] % answer[j] == 0</code>, or</li>
	<li><code>answer[j] % answer[i] == 0</code></li>
</ul>

<p>If there are multiple solutions, return any of them.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3]
<strong>Output:</strong> [1,2]
<strong>Explanation:</strong> [1,3] is also accepted.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,4,8]
<strong>Output:</strong> [1,2,4,8]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 2 * 10<sup>9</sup></code></li>
	<li>All the integers in <code>nums</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
int dp[1010][1010];
int rec(int level,int mini,vector<int>&a)
{
    if(level<0){return 0;}
    if(dp[level][mini]!=-1){return dp[level][mini];}
    int ans=1;
    for(int i=0;i<level;i++)
    {
        if(a[i]%a[mini]==0||a[mini]%a[i]==0)
        {
            int temp=mini;
            if(a[i]<a[mini]){temp=i;}
            ans=max(ans,1+rec(i,temp,a));
        }
    }
    return dp[level][mini]=ans;
}
vector<int>ans;
void printset(int level,int mini,vector<int>&a)
{
    if(level<0){return;}
    int found=0;
    for(int i=0;i<level;i++)
    {
        if((a[i]%a[mini]==0||a[mini]%a[i]==0)&&found==0)
        {
            int temp=mini;
            if(a[i]<a[mini]){temp=i;}
            if(rec(i,temp,a)==dp[level][mini]-1)
            {
                ans.push_back(a[i]);
                printset(i,temp,a);
                found=1;
            }
        }
    }
}
    vector<int> largestDivisibleSubset(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        memset(dp,-1,sizeof(dp));
        int ind;
        int maxi=-1e9;
        for(int i=0;i<nums.size();i++)
        {
            int a=rec(i,i,nums);
            if(a>=maxi)
            {
                maxi=a;
                ind=i;
            }
        }
        ans.push_back(nums[ind]);
        printset(ind,ind,nums);
        return ans;
    }
};
16000