백준 14888문제

#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i=a ; i<b ; i++)

int N,A[11],op[4],m = 1e9+1,M=-(1e9+1); 

void cal(int cur, int id){
    if(id==N){
        m = min(m,cur);
        M = max(M,cur);
        return;
    }
    FOR(i,0,4){
        if(op[i]){
            op[i]--;
            switch(i){
                case 0: 
                    cal(cur+A[id],id+1);
                    break;
                case 1:
                    cal(cur-A[id],id+1);
                    break;
                case 2:
                    cal(cur*A[id],id+1);
                    break;
                case 3:
                    cal(cur/A[id],id+1);
            }
            ++op[i];
        }
    }
}

int main(){
    ios_base::sync_with_stdio(false);

    cin >> N;
    FOR(i,0,N) cin >> A[i];
    FOR(i,0,4) cin >> op[i];

    cal(A[0],1);

    cout << M << '\n' << m << '\n';

    return 0;
}

백준 14888 문제 풀이입니다.