<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();
        if(N==1)return false;
        int acc=nums[0];
        for(int i=1;i<N;i++)acc+=nums[i];
        vector<vector<bool>>dp(N+1,vector<bool>(acc+1,0));
        dp[0][0]=1;
        for(int i=0;i<N;i++){
            for(int n=N/2;n>=0;n--)for(int v=0;v<=acc;v++)if(dp[n][v]){
                dp[n+1][v+nums[i]]=1;
                if(n+1!=N&&(v+nums[i])*N==acc*(n+1)){
                    return true;
                }
            }
        }
        return false;
    }
};
18605