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