GFG-LARGEST-DIVISIBLE-SUBSET

#include <bits/stdc++.h>
using namespace std;

int largestSubset(int a[], int n) {
    int dp[n];
    dp[n - 1] = 1;
 
    for (int i = n - 2; i >= 0; i--) {
        int mxm = 0;
        for (int j = i + 1; j < n; j++)
            if (a[j] % a[i] == 0 || a[i] % a[j] == 0)
                mxm = max(mxm, dp[j]);
 
        dp[i] = 1 + mxm;
    }

    return *max_element(dp, dp + n);
}

int main() {
    int a[] = { 1, 3, 6, 13, 17, 18 };
    int n = sizeof(a) / sizeof(a[0]);
    cout << largestSubset(a, n) << endl;
    return 0;
}