fork download
  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 = { 1, 2, 2, 2, 3, 4, 4 };
  10. sort(p.begin(), p.end());
  11. int z = solve(p);
  12. do {
  13. if(solve(p) == z) {
  14. for(int i = 0; i < 7; i++) cout << p[i] << ' ';
  15. cout << endl;
  16. }
  17. } while(next_permutation(p.begin(), p.end()));
  18. return 0;
  19. }
Success #stdin #stdout 0s 15232KB
stdin
Standard input is empty
stdout
1 2 2 2 3 4 4 
2 1 2 2 3 4 4 
2 2 1 2 3 4 4 
2 2 2 1 3 4 4 
3 1 2 2 2 4 4 
3 2 1 2 2 4 4 
3 2 2 1 2 4 4 
3 2 2 2 1 4 4 
4 1 2 2 2 3 4 
4 2 1 2 2 3 4 
4 2 2 1 2 3 4 
4 2 2 2 1 3 4 
4 3 1 2 2 2 4 
4 3 2 1 2 2 4 
4 3 2 2 1 2 4 
4 3 2 2 2 1 4 
4 4 1 2 2 2 3 
4 4 2 1 2 2 3 
4 4 2 2 1 2 3 
4 4 2 2 2 1 3 
4 4 3 1 2 2 2 
4 4 3 2 1 2 2 
4 4 3 2 2 1 2 
4 4 3 2 2 2 1