<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 check(int cur, int idx, int len, vector<vector<vector<bool>>>&dp,vector<int>&nums){
        if(len == 0) return cur == 0;
        if(idx == nums.size()) return false;
        if(cur < 0) return false;
        if(dp[idx][len][cur] == false) return false;
        if(check(cur-nums[idx], idx+1, len-1, dp, nums)) return dp[idx][len][cur] = true;
        if(check(cur, idx+1, len, dp, nums)) return dp[idx][len][cur] = true;
        return dp[idx][len][cur] = false;
    }
    
    bool splitArraySameAverage(vector<int>& nums) {
        int n = nums.size(), sum = 0;
        for(int i:nums) sum+=i;
        vector<vector<vector<bool>>>dp(n+1, vector<vector<bool>>(n+1, vector<bool>(sum+1, true)));
        for(int i = 1; i <= n-1; i++) if((sum*i)%n == 0) if(check((sum*i)/n, 0, i, dp, nums)) return true;
        return false;
    }
};
198521