백준 14888. 연산자 끼워넣기 :: 돼지개발자

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

"브루트포스"

다해보자~

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
 
public class Main {
 
    static int N;
    static int num[];
    static int op[] = new int[4];
    static int max = Integer.MIN_VALUE;
    static int min = Integer.MAX_VALUE;
    
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        
        N = Integer.parseInt(br.readLine());
        
        num = new int[N];
        StringTokenizer st = new StringTokenizer(br.readLine());
        
        for (int i = 0; i < N; i++) {
            num[i] = Integer.parseInt(st.nextToken());
        }
        
        st = new StringTokenizer(br.readLine());
        
        for (int i = 0; i < 4; i++) {
            op[i] = Integer.parseInt(st.nextToken());
        }
        
        solve(1,num[0],op[0],op[1],op[2],op[3]);
        
        System.out.println(max);
        System.out.println(min);
    }
    
    static void solve(int idx, int sum, int op1, int op2, int op3, int op4 ) {
        
        if(idx == N) {
            max = Math.max(max, sum);
            min = Math.min(min, sum);
            return ;
        }
        
        if(op1 > 0) { solve(idx+1, sum +num[idx], op1-1,op2,op3,op4 ); }
        if(op2 > 0) { solve(idx+1, sum -num[idx], op1,op2-1,op3,op4 ); }
        if(op3 > 0) { solve(idx+1, sum *num[idx], op1,op2,op3-1,op4 ); }
        if(op4 > 0) { solve(idx+1, sum /num[idx], op1,op2,op3,op4-1 ); }
    }
}