Practice_Problems/Split array ( Recursion ) (hackerblock).cpp at master · MayukhC99/Practice_Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include<bits/stdc++.h>
#define speed ios_base::sync_with_stdio(false)
#define boost cin.tie(NULL)
#define booster cout.tie(NULL)
#define endl "\n"
typedef long long int lld;

#define F(a,n) for(int i=0;i<n;i++){cin>>a[i];}
#define F1(a,n) for(int i=1;i<=n;i++){cin>>a[i];}

using namespace std;
int count=0;


void printv(vector<lld> a,vector<lld> b,map<int,int> mp){

	for(int i=0;i<b.size();i++){
		if(mp[i]>0)
			continue;
		else
			cout<<" "<<b[i];
	}
	cout<<" and";
	for(lld i=0;i<a.size();i++)
		cout<<" "<<a[i];
	cout<<endl;
	// for(lld i=0;i<b.size();i++)
	// 	cout<<" "<<b[i];
	// cout<<" and";
	// for(lld i=0;i<a.size();i++)
	// 	cout<<" "<<a[i];
	// cout<<endl;

	return ;
}

void recurse(vector<lld>& ar,vector<lld> sub1,lld i,lld sum,lld tsum,map<int,int> mp){

	if(i==ar.size()){

		if(sum==(tsum-sum) && sub1.size()!=ar.size()){
			::count++;
			printv(sub1,ar,mp);
		}

		return;
	}

	recurse(ar,sub1,i+1,sum,tsum,mp);

	sub1.push_back(ar[i]);
	//sub2.erase( find(sub2.begin(),sub2.end(),ar[i]) );
	sum+= ar[i];
	mp[i]=1;

	recurse(ar,sub1,i+1,sum,tsum,mp);

}

int main() {
	lld N;
	cin>>N;
	if(N<=0){
		cout<<"0";
		return 0;
	}
	vector<lld> ar(N);
	vector<lld> sub1;

	lld sum=0;
	for(lld i=0;i<N;i++){
		cin>>ar[i];
		sum+= ar[i];
	}

	// if(sum%2 != 0){
	// 	cout<<"0";
	// 	return 0;
	// }
	map<int,int> mp;

	recurse(ar,sub1,0,0,sum,mp);
	cout<<::count;

	return 0;
}