[백준] 2309번 일곱 난쟁이 (Python,C++)

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

2309번: 일곱 난쟁이

---

SOLUTION CODE

# PYTHON

1) Combination

from itertools import combinations
    
# arr=[]
# for i in range(9):
#     arr.append(int(input()))
heights = [int(input()) for _ in range(9)]

for combi in combinations(heights,7):
    if sum(combi)==100:
        for height in sorted(combi):
            print(height)
            
        break

 

2) 다른 풀이

heights=[int(input()) for _ in range(9)]
heights.sort()
tot = sum(heights)
flag = False
def f():
    for i in range(8):
        for j in range(i+1,9):
            if tot - heights[i] - hisights[j]==100:
                for k in range(9):
                    if i !=k and j !=k:
                        print(k)
                
                return

f()

---

# C++

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int arr[9];
int res[7];

int main()
{
    int sum = 0;
    for (int i = 0; i < 9; i++)
    {
        cin >> arr[i];
    }

    sort(arr, arr + 9);

    do
    {
        int sum=0;
        for(int i=0;i<7;i++){
            sum+=arr[i];
        }
        
        if(sum==100){
            for(int j=0;j<7;j++){
                res[j] = arr[j];
            }
            sort(res,res+7);
            for(int j=0;j<7;j++){
                cout<<res[j]<<'\n';
            }
            return 0;
        }

    } while (next_permutation(arr,arr+9));

    return 0;
}