[20260301] BOJ / G4 / 동전 바꿔주기 / 이준희#1983
Merged
ShinHeeEul merged 1 commit intomainfrom Mar 1, 2026
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/2624
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
동전의 가치와 가지고있는 개수가 주어졌을 때
T의 가치를 가진 지폐를
바꿔줄 수 있는 경우의 수를 구하는 문제입니다.
🔍 풀이 방법
dp를 이용해서 풀었습니다.
이 때 T부터 되돌아 가면서 dp를 계산하여 동전 중복사용의 경우를 피했습니다
⏳ 회고
전형적인 dp 문제였습니다