[20251105] BOJ / G5 / 물병 / 김수연 #1322
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/1052
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
물병 N개로 K개를 넘지않는 비어있지 않은 물병을 만드려고 할 때, 상점에서 사야하는 물병의 최솟값 구하기
🔍 풀이 방법
N을 비트로 나타내서 1의 개수가 하나의 병이라고 가정
N을 1씩 더해서 비트 1의 개수가 K보다 작거나 같으면 수행 중지
⏳ 회고
비트마스킹..쩝..