CS/알고리즘
[TIL] 20240308 18일차
creative.darkstar
2024. 3. 8. 23:52
SWEA 5215. 햄버거 다이어트
https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWT-lPB6dHUDFAVT&
SW Expert Academy
SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요!
swexpertacademy.com
시행착오 코드 1
더보기
def cases(combination, calories, limit):
global final_cases
if limit == 0 or limit < min(calories):
final_cases.append(' '.join(combination))
return
for idx, num in enumerate(calories):
if limit >= num:
combination.append(num)
next_calories = calories[:]
next_calories.remove(num)
cases(combination, next_calories, limit=(limit - num))
combination.pop()
# else:
# limit = limit + num
# combination.pop()
testcases = int(input())
final_cases = []
for t1 in range(testcases):
sorts, final_limit = map(int, input().split())
data = []
for t2 in range(sorts):
data.append(list(map(int, input().split())))
cases([], [d[1] for d in data], final_limit)
print(final_cases)
answer = 0
print(f"#{t1} {answer}")