fork(1) download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int solve(vector<int> v) {
  4. 	int ret = 0;
  5. 	for(int i = 1; i < v.size(); i++) ret += max(v[i], v[i - 1]);
  6. 	return ret;
  7. }
  8. int main() {
  9. 	vector<int> p(7);
  10. 	for(int i = 0; i < 7; i++) p[i] = i + 1;
  11. 	do {
  12. 		if(solve(p) == 27) {
  13. 			for(int i = 0; i < 7; i++) cout << p[i] << ' ';
  14. 			cout << endl;
  15. 		}
  16. 	} while(next_permutation(p.begin(), p.end()));
  17. 	return 0;
  18. }
Success #stdin #stdout 0s 15232KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1 2 3 4 5 6 7 
2 1 3 4 5 6 7 
3 1 2 4 5 6 7 
3 2 1 4 5 6 7 
4 1 2 3 5 6 7 
4 2 1 3 5 6 7 
4 3 1 2 5 6 7 
4 3 2 1 5 6 7 
5 1 2 3 4 6 7 
5 2 1 3 4 6 7 
5 3 1 2 4 6 7 
5 3 2 1 4 6 7 
5 4 1 2 3 6 7 
5 4 2 1 3 6 7 
5 4 3 1 2 6 7 
5 4 3 2 1 6 7 
6 1 2 3 4 5 7 
6 2 1 3 4 5 7 
6 3 1 2 4 5 7 
6 3 2 1 4 5 7 
6 4 1 2 3 5 7 
6 4 2 1 3 5 7 
6 4 3 1 2 5 7 
6 4 3 2 1 5 7 
6 5 1 2 3 4 7 
6 5 2 1 3 4 7 
6 5 3 1 2 4 7 
6 5 3 2 1 4 7 
6 5 4 1 2 3 7 
6 5 4 2 1 3 7 
6 5 4 3 1 2 7 
6 5 4 3 2 1 7 
7 1 2 3 4 5 6 
7 2 1 3 4 5 6 
7 3 1 2 4 5 6 
7 3 2 1 4 5 6 
7 4 1 2 3 5 6 
7 4 2 1 3 5 6 
7 4 3 1 2 5 6 
7 4 3 2 1 5 6 
7 5 1 2 3 4 6 
7 5 2 1 3 4 6 
7 5 3 1 2 4 6 
7 5 3 2 1 4 6 
7 5 4 1 2 3 6 
7 5 4 2 1 3 6 
7 5 4 3 1 2 6 
7 5 4 3 2 1 6 
7 6 1 2 3 4 5 
7 6 2 1 3 4 5 
7 6 3 1 2 4 5 
7 6 3 2 1 4 5 
7 6 4 1 2 3 5 
7 6 4 2 1 3 5 
7 6 4 3 1 2 5 
7 6 4 3 2 1 5 
7 6 5 1 2 3 4 
7 6 5 2 1 3 4 
7 6 5 3 1 2 4 
7 6 5 3 2 1 4 
7 6 5 4 1 2 3 
7 6 5 4 2 1 3 
7 6 5 4 3 1 2 
7 6 5 4 3 2 1
https://ideone.com/Y2rpl7
language:
C++14 (gcc 8.3)
created:
7 years ago
visibility:
public

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!