[20250922] BOJ / G4 / 점심메뉴 / 김민진 #951
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.
🧷 문제 링크
점심메뉴
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
주어진 단맛과 매운맛을 가지는 음식이 있을 때 승관이와 영우가 모두 만족할 수 있는 메뉴의 수는?
🔍 풀이 방법
lowerBound랑 upperBound 둘 다 써야함
매운맛의 최소값은 lowerBound로 비교하고 최대값은 upperBound로 비교하기..
lowerBound는 찾고자 하는 값 이상인 것, upperBound는 찾고자 하는 값 초과인 것
⏳ 회고
이진탐색은 어려워~~