<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:
unordered_map<string,bool>mp;

bool solve(int i,vector<int>& nums, int sum, int cnt )
{
    if(i>=nums.size()) return false;
    if(cnt == 0)
    {
        if(sum == 0) return true;
        else return false;
    }
    string k=to_string(i)+" "+to_string(sum)+" "+to_string(cnt);

    if(mp.find(k)!=mp.end())
        return mp[k];

    bool ex = false, inc = false;
    ex = solve(i+1, nums, sum, cnt);
    if(ex) return mp[k]  = 1;
    if(sum - nums[i] >=0)
    inc = solve(i+1, nums, sum - nums[i], cnt-1);

    return mp[k] = ex | inc;
}
    bool splitArraySameAverage(vector<int>& nums) {
        mp.clear();
        int n = nums.size();
        int sum = accumulate(nums.begin(), nums.end(), 0);
        for(int i = 1;i<n;i++)
        {
            if((sum*i) % n == 0)
            {
                int s = (sum*i)/n;
                if(solve(0, nums, s, i))
                return true;
            }

        }
        return false;

    }
};
384241