연산자 끼워넣기

https://www.acmicpc.net/problem/14888

14888번: 연산자 끼워넣기

로또 문제 기억하는가?

같은 문자가 포함된 순열

 

내 코드

#include <iostream>
#include <algorithm>
#include <vector>
 
using namespace std;
 
int op[5];
 
int calc(vector<int>& num, vector<int>& d)
{
    int sum = num[0];
    int now = 0;
    for (int i = 0; i < d.size(); i++)
    {
        if (d[i] == 0) {
            sum = sum + num[i + 1];
        }
        else if (d[i] == 1) {
            sum = sum - num[i + 1];
        }
        else if (d[i] == 2) {
            sum = sum * num[i + 1];
        }
        else if (d[i] == 3) {
            sum = sum / num[i + 1];
        }
    }
 
    return sum;
}
 
 
int main()
{
    int n;
    cin >> n;
    vector<int> num(n);
 
    for (int i = 0; i < n; i++)
    {
        cin >> num[i];
    }
 
    for (int i = 0; i < 4; i++)
    {
        cin >> op[i];
    }
 
    vector<int> d;
    for (int i = 0; i < op[0]; i++)
        d.push_back(0);
 
    for (int i = 0; i < op[1]; i++)
        d.push_back(1);
 
    for (int i = 0; i < op[2]; i++)
        d.push_back(2);
 
    for (int i = 0; i < op[3]; i++)
        d.push_back(3);
 
    int min = 100000000;
    int max = -100000000;
    int now;
    do {
        now = calc(num, d);
        if (min > now)
            min = now;
        if (max < now)
            max = now;
    } while (next_permutation(d.begin(), d.end()));
 
    cout << max << '\n' << min;
}

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int calc(vector<int> &a, vector<int> &b) {
    int n = a.size();
    int ans = a[0];
    for (int i=1; i<n; i++) {
        if (b[i-1] == 0) {
            ans = ans + a[i];
        } else if (b[i-1] == 1) {
            ans = ans - a[i];
        } else if (b[i-1] == 2) {
            ans = ans * a[i];
        } else {
            ans = ans / a[i];
        }
    }
    return ans;
}
 
int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i=0; i<n; i++) {
        cin >> a[i];
    }
    vector<int> b;
    for (int i=0; i<4; i++) {
        int cnt;
        cin >> cnt;
        for (int k=0; k<cnt; k++) {
            b.push_back(i);
        }
    }
    sort(b.begin(),b.end());
    vector<int> result;
    do {
        int temp = calc(a, b);
        result.push_back(temp);
    } while (next_permutation(b.begin(), b.end()));
    auto ans = minmax_element(result.begin(), result.end());
    cout << *ans.second << '\n';
    cout << *ans.first << '\n';
    return 0;
}