Merged
Conversation
03do-new30
reviewed
Feb 11, 2025
suyeun84/202502/11 BOJ G5 창영이와 커피.md
Outdated
Comment on lines
+23
to
+31
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
3 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/22115
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
창영이가 정확히 K만큼의 카페인을 섭취하기 위해서 최소 몇 개의 커피를 마셔야 하는지 구하기
🔍 풀이 방법
dp 사용
각 커피에 대해서 dp의 coffee[i]~K를 돌면서 dp에 최소 커피 갯수 저장하기
⏳ 회고
if (coffee[i] > K) continue;
이거 안넣어줘서 계속 IndexOutOfBound 에러 뜸,,,,ㅋ,,,,, 범위 조심....