[소프트웨어 익스퍼트 아카데미][SWEA][모의 SW 역량테스트][ C++][4008번] 숫자 만들기

이 문제는 do while과 next_permutation을 통해 모든 경우를 고려하여 풀었습니다.

#include<iostream>
#include<vector>
#include<deque>
#include<algorithm>
using namespace std;
 
int N;
int ans;
int cal[5];
 
vector<int> val_sort;
vector<int> val;
deque<int> max_min;
 
void init() {
    ans = 0;
    val.clear();
    val_sort.clear();
    max_min.clear();
}
//+(1) -(2) *(3) /(4)
void func() {
    int sum;
    do {
        sum = val[0]; int pos = 1;
        for (register int i = 0; i < val_sort.size(); i++) {
            if (val_sort[i] == 1) {
                sum += val[pos];
            }
            if (val_sort[i] == 2) {
                sum -= val[pos];
            }
            if (val_sort[i] == 3) {
                sum *= val[pos];
            }
            if (val_sort[i] == 4) {
                sum /= val[pos];
            }
            if (i == N - 1) break;
            pos++;
        }
        max_min.push_back(sum);
    } while(next_permutation(val_sort.begin(), val_sort.end()));
        sort(max_min.begin(),max_min.end());
        ans = max_min.back() - max_min.front();
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int T;
    scanf("%d", &T);
    //cin >> T;
    for (register int t = 1; t <= T; t++) {
        init();
        scanf("%d", &N);
        for (register int i = 1; i < 5; i++) {
            int temp_cal;
            scanf("%d", &temp_cal);
            //cin >> temp_cal;
            if (temp_cal == 0) continue;
            for (register int j = 1; j <= temp_cal; j++)
                val_sort.push_back(i);
        }
        for (register int i = 1; i <= N; i++) {
            int temp_val;
            scanf("%d", &temp_val);
            //cin >> temp_val;
            val.push_back(temp_val);
        }
        func();
        printf("#%d %d\n", t, ans);
        //cout << "#" << t << " " << ans << endl;
    }
}