<p>You are given an integer array <code>nums</code>.</p>

<p>You should move each element of <code>nums</code> into one of the two arrays <code>A</code> and <code>B</code> such that <code>A</code> and <code>B</code> are non-empty, and <code>average(A) == average(B)</code>.</p>

<p>Return <code>true</code> if it is possible to achieve that and <code>false</code> otherwise.</p>

<p><strong>Note</strong> that for an array <code>arr</code>, <code>average(arr)</code> is the sum of all the elements of <code>arr</code> over the length of <code>arr</code>.</p>

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

<pre>
<strong>Input:</strong> nums = [1,2,3,4,5,6,7,8]
<strong>Output:</strong> true
<strong>Explanation:</strong> We can split the array into [1,4,5,8] and [2,3,6,7], and both of them have an average of 4.5.
</pre>

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

<pre>
<strong>Input:</strong> nums = [3,1]
<strong>Output:</strong> false
</pre>

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

<ul>
	<li><code>1 &lt;= nums.length &lt;= 30</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution {
public:
    bool splitArraySameAverage(vector<int>& nums) {
        int n = nums.size();
        int tsum = 0;
        for(int i = 0; i<n; i++)
        {
            tsum += nums[i];
        }
        int n1 = n/2;

        map<int,map<int,int>> map1;
        for(int mask = 0; mask<pow(2,n1); mask++)
        {
            int sum = 0;
            int ct = 0;
            for(int i = 0; i<n1; i++)
            {
                int n11 = 1<<i;
                if((mask&n11))
                {
                    sum += nums[i];
                    ct++;
                }
            }
            map1[sum][ct] = 1;
        }

        for(int mask = 1; mask<pow(2,(n-n1)); mask++)
        {
            int sum = 0;
            int ct = 0;
            for(int i = 0; i<n-n1; i++)
            {
                int n11 = 1<<i;
                if((mask&n11))
                {
                    sum += nums[i+n1];
                    ct++;
                }
            }

            for(int i = ct; i<n; i++)
            {
                int ct1 = i;
                int ct2 = n-i;

                int val1 = ct1*tsum;
                val1 -= (n*sum);
                if(val1%n == 0)
                {
                    int val2 = val1/n;
                    if(map1[val2][i-ct] == 1)
                    {
                        return true;
                    }
                }
            }
        }
        return false;
    }
};
41820