<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:
map<int, set<int>> get(vector<int>& nums, int low, int high)
{
    int n = nums.size()/2;
    map<int, set<int>> ans;
    for(int mask = 0;mask<(1<<n);mask++)
    {   int cnt  = 0, sum = 0;
        for(int i = low;i<high;i++)
        {
            if(mask & (1<<(i-low)))
            {
                cnt++;
                sum += nums[i];
            }
        }
        ans[cnt].insert(sum);
    }
    return ans;

}
bool check(int sum, int n1, int n)
{
    if((sum*n1) % n == 0) return true;
    else return false;
}
    bool splitArraySameAverage(vector<int>& nums) {
        int n = nums.size();
        int sum = accumulate(nums.begin(), nums.end(), 0);

        map<int, set<int>>l = get(nums, 0, n/2);
        map<int, set<int>>r = get(nums, n/2, n);

        for(auto i : l)cout<<i.first<<" "<<i.second.size()<<endl;
        for(auto x : l)
        {
            for(auto y : r)
            {
                int n1 = x.first + y.first;
                if(n1==0 || n - n1 == 0 || !check(sum, n1, n))continue;

                int reqSum = (sum*n1)/n;

                for(auto k : x.second)
                {
                    if(y.second.find(reqSum - k) != y.second.end()) 
                    return true;
                }
            }
        }
        return false;
    }
};
134680