[20251013] BOJ / G5 / 계란으로 계란치기 / 이준희 #1106
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
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
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
계란으로 계란을 깰 때 계란은 각 계란의 무게만큼 내구도가 깎이고 내구도가 0이하가 되면 깨집니다.
이 때 최대한 많은 계란을 쳐서 깨는 경우를 구하는 문제입니다.
🔍 풀이 방법
dfs로 모든 경우의 수를 다 돌아서 계산했습니다.
⏳ 회고
뭔가 좀 노가다인 것 같았는데 2초라 여유 있었던 것 같습니다.