[20251013] BOJ / G5 / 계란으로 계란치기 / 김수연#1109
Merged
ShinHeeEul merged 1 commit intomainfrom Oct 13, 2025
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/16987
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
계란으로 계란을 치는데, 각 계란의 내구성에서 무게만큼 줄어들고 0이하가 되면 깨진다.
이때, 최대 몇 개의 계란을 깰 수 있는지 구하기
🔍 풀이 방법
dfs 이용
모든 경우 돌리면서 깨진 갯수가 가장 많은거 찾음
근데 계란 하나도 못깻을 때 다음으로 넘어가는 로직 작성을 해줘야됐음..
⏳ 회고
아옹..꼼꼼히 풀자..