<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 {
    std::set<std::pair<int,int>> p(vector<int> nums){
        std::set<std::pair<int,int>> possible;
        possible.insert({0,0});
        for(int x:nums){
            std::set<std::pair<int,int>> add;
            for(std::pair<int,int> y:possible){
                add.insert({y.first+x,y.second+1});
            }
            for(std::pair<int,int> y:add)possible.insert(y);
        }
        return possible;
    }
public:
    bool splitArraySameAverage(vector<int>& nums) {
        int sum=0;
        for(int x:nums)sum+=x;
        if(nums.size()<10){
            std::set<std::pair<int,int>> possible=p(nums);
            for(auto x:possible){
                if(x.second!=0 && x.second!=nums.size() &&std::abs(1.0*x.first/x.second-1.0*sum/nums.size())<0.001){
                    //std::cout<<x.first<<" "<<x.second<<" "<<sum<<" "<<nums.size();
                    return true;
                }
            }
            return false;
        }else{
            std::vector<int> l,r;
            for(int i=0;i<nums.size()/2;i++)l.push_back(nums[i]);
            for(int i=nums.size()/2;i<nums.size();i++)r.push_back(nums[i]);
            std::set<std::pair<int,int>> pl=p(l),pr=p(r);
            for(auto x:pl){
                for(int y=0;y<30;y++){
                    if(y==0 && x.second==0)continue;
                    if(y+x.second>=nums.size())continue;
                    if((sum*(y+x.second))%nums.size()!=0)continue;
                    if(pr.find({sum*(y+x.second)/nums.size()-x.first,y})!=pr.end()){
                        std::cout<<x.first<<" "<<x.second<<" "<<y<<" "<<1.0*sum/nums.size()*(y+x.second)-x.first;
                        return true;
                    }
                }
            }
            return false;
        }
    }
};
59231