fork download
copy 
  1. #include <algorithm>
  2. #include <iostream>
  3. #include <vector>
  4. using namespace std;
  5. void f(int i, vector<int> &v, vector<int> &ans){
  6. 	while(i<v.size()){
  7. 		for(int x: ans)	cout<<x<<'\t';
  8. 		cout<<v[i]<<endl;
  9. 		ans.push_back(v[i]);
  10. 		f(++i, v, ans);
  11. 		ans.pop_back();
  12. 	}
  13. }
  14. int main() {
  15. 	int n,x;
  16. 	vector<int> v;
  17. 	cin>>n;
  18. 	while(n--&&cin>>x)	v.push_back(x);
  19. 	sort(v.begin(),v.end());
  20. 	vector<int> rec_temp;
  21. 	f(0,v,rec_temp);	//	recursive approach
  22. 	return 0;
  23. 	// iterative approach
  24. 	vector<vector<int>> ans;
  25. 	vector<int> temp;
  26. 	n = v.size();
  27. 	for(int i=n-1; i>=0; i--){
  28. 		x = ans.size();
  29. 		for(int j=0; j<x; j++){
  30. 			temp = vector<int>(1,v[i]);	//	array containing single element v[i]
  31. 			temp.insert(temp.end(),ans[j].begin(),ans[j].end());
  32. 			ans.push_back(temp);
  33. 		}
  34. 		temp = vector<int>(1,v[i]);
  35. 		ans.push_back(temp);
  36. 	}
  37. 	ans.push_back(vector<int>(0));
  38. 	x = ans.size();
  39. 	for(int i=x-1; i>=0; i--){
  40. 		for(int j=0; j<ans[i].size(); j++)	cout<<ans[i][j]<<'\t';
  41. 		cout<<endl;
  42. 	}
  43. 	return 0;
  44. }
Success #stdin #stdout 0s 4348KB
comments ()
stdin
copy 
5
5 2 1 6 4
stdout
copy 
1
1	2
1	2	4
1	2	4	5
1	2	4	5	6
1	2	4	6
1	2	5
1	2	5	6
1	2	6
1	4
1	4	5
1	4	5	6
1	4	6
1	5
1	5	6
1	6
2
2	4
2	4	5
2	4	5	6
2	4	6
2	5
2	5	6
2	6
4
4	5
4	5	6
4	6
5
5	6
6
https://ideone.com/DXm5uR
joe's subset power set
language:
C++14 (gcc 8.3)
created:
5 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!