<p>You are given <code>nums</code>, an array of positive integers of size <code>2 * n</code>. You must perform <code>n</code> operations on this array.</p>

<p>In the <code>i<sup>th</sup></code> operation <strong>(1-indexed)</strong>, you will:</p>

<ul>
	<li>Choose two elements, <code>x</code> and <code>y</code>.</li>
	<li>Receive a score of <code>i * gcd(x, y)</code>.</li>
	<li>Remove <code>x</code> and <code>y</code> from <code>nums</code>.</li>
</ul>

<p>Return <em>the maximum score you can receive after performing </em><code>n</code><em> operations.</em></p>

<p>The function <code>gcd(x, y)</code> is the greatest common divisor of <code>x</code> and <code>y</code>.</p>

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

<pre>
<strong>Input:</strong> nums = [1,2]
<strong>Output:</strong> 1
<strong>Explanation:</strong>&nbsp;The optimal choice of operations is:
(1 * gcd(1, 2)) = 1
</pre>

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

<pre>
<strong>Input:</strong> nums = [3,4,6,8]
<strong>Output:</strong> 11
<strong>Explanation:</strong>&nbsp;The optimal choice of operations is:
(1 * gcd(3, 6)) + (2 * gcd(4, 8)) = 3 + 8 = 11
</pre>

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

<pre>
<strong>Input:</strong> nums = [1,2,3,4,5,6]
<strong>Output:</strong> 14
<strong>Explanation:</strong>&nbsp;The optimal choice of operations is:
(1 * gcd(1, 5)) + (2 * gcd(2, 4)) + (3 * gcd(3, 6)) = 1 + 4 + 9 = 14
</pre>

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

<ul>
	<li><code>1 &lt;= n &lt;= 7</code></li>
	<li><code>nums.length == 2 * n</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>6</sup></code></li>
</ul>

from typing import List
from math import gcd

class Solution:
    def maxScore(self, nums: List[int]) -> int:
        n = len(nums) // 2
        totalStates = 1 << (2 * n)  # Total number of subsets (2^(2*n))
        dp = [0] * totalStates  # DP table initialized to 0

        for mask in range(totalStates):
            bits = bin(mask).count('1') 
            if bits % 2 == 1:
                continue
            numPairs = bits // 2
            # Calculate operation index based on the number of pairs used
            operation = numPairs + 1
            
            # Iterate over all possible pairs of indices
            for i in range(2 * n -1):
                if mask & (1 << i) == 0:  # If element i is not used in the current mask
                    for j in range(i + 1, 2 * n):
                        if mask & (1 << j) == 0:  # If element j is not used in the current mask
                            newMask = mask | (1 << i) | (1 << j)  # Mark elements i and j as used
                            dp[newMask] = max(dp[newMask], dp[mask] + operation * gcd(nums[i], nums[j]))

        return dp[totalStates - 1]


1043