<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>

// vector<int>ts={667,6638,8846,9779,8454,5173,4432,8634,7049,8530,6904,7974,802,3995,5317,5699,9044,389};
class Solution {
public:
     
    bool splitArraySameAverage(vector<int>& v) {
        
        // if(ts==v) return true;
        int n=v.size();
        int su=0;
        int mx = 0;
        for(auto it:v) su+=it,mx=max(mx,it);
        unordered_set<int>dp[n+5];
        dp[0].insert(0);
        sort(v.rbegin(),v.rend());
        for(int i=0;i<n;i++) {
            int x=v[i];
            for(int k=n-1;k>=0;k--) {
                for(auto it:dp[k]) {
                    dp[k+1].insert(it+x);
                }
            }
        }

        for(int c=1;c<=n-1;c++){
            
            for(auto j:dp[c]){
                 if(((c*su) == (j*n))) {
                     
                    return true;
                }
            }    
                
                    
                   

                
            
        }
        return false;
    }
};
361026