백준 2309. 일곱난쟁이 :: 돼지개발자

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

"DFS"

import java.util.Arrays;
import java.util.Scanner;
 
public class Main {
 
    static int[] talls = new int[9];
    static boolean[] visited = new boolean[9];
    static boolean find;
    static int[] res = new int[7];
    static Scanner sc = new Scanner(System.in);
    
    public static void main(String[] args) {
        
        for (int i = 0; i < 9; i++) {
            talls[i] = sc.nextInt();
        }
        
        solve(0,0);
        Arrays.sort(res);
        
        for (int i = 0; i < 7; i++) {
            System.out.println(res[i]);
        }
    }
    
    static void solve(int cnt, int sum) {
        if(find) return;
        
        if(cnt == 7) {
            if(sum == 100) {
                int idx = 0;
                for (int i = 0; i < 9; i++) {
                    if(visited[i]) {
                        res[idx++] = talls[i];
                        find = true;
                    }
                }
            }
            return ;
        }
        
        for (int i = 0; i < 9; i++) {
            if(visited[i]) continue;
            
            visited[i] = true;
            solve(cnt+1,sum + talls[i]);
            visited[i] = false;
        }
        
    }
}