[알고리즘] 백준 2309번 일곱 난쟁이

 

 

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

2309번: 일곱 난쟁이

 

import java.util.Arrays;
import java.util.Scanner;

public class Prac {

	static int[] shortPeople = new int[9];
	
	static int[] answer = new int[7];
	
   public static void main(String[] args) {
      Scanner sc = new Scanner(System.in);
      
      for(int i=0; i<shortPeople.length; i++) {
    	  shortPeople[i] = sc.nextInt();
      }
      combination(0, 0);
   }
   
   static void combination(int n, int start) {
	   if(n==7) {
		   if(Arrays.stream(answer).sum()==100) {
			   Arrays.sort(answer);
			   for(int i=0; i<answer.length; i++) {
				   System.out.println(answer[i]);
			   }
		   }
		   return;
	   }
	   
	   for(int i=start; i<shortPeople.length; i++) {
		   answer[n] = shortPeople[i];
		   combination(n+1, i+1);
	   }
   }
}