[20250924] BOJ / G5 / 합 분해 / 이준희 #963
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/2225
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
n과 k가 주어졌을 때 0부터 n까지의 수 k개를 더해서 n이 되는 경우의 수를 구하는 문제입니다.
덧셈의 순서가 바뀌면 다른 경우로 세며 하나의 수를 여러번 사용할 수 있습니다.
🔍 풀이 방법
DP를 활용해서 풀었습니다. dp[i][j] 에서 i개의 수를 써서 j를 만들 수 있는 경우의 수를 구했습니다.
⏳ 회고
간단한 dp 였던 것 같았는데 점화식이 생각이 잘 나지 않았습니다