[20260131] BOJ / G1 / 부분수열의 합 2 / 한종욱 #1863
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/1208
🧭 풀이 시간
120분
👀 체감 난이도
✏️ 문제 설명
부분 수열의 합이 S가 되는 경우의 수의 개수는?
🔍 풀이 방법
N이 최대 40이라 부분수열을 하나씩 다 구하면 시간초과가 발생한다.
수열을 두 개로 나눠서 각각 부분수열을 구하고 각 집합의 합을 비교해서 경우의 수를 계산한다.
이때, 이분 탐색을 사용하고 S가 0일 경우엔 양쪽에서 모두 안 뽑는 경우가 있기 때문에 1빼준다.
⏳ 회고
G선생이 없었다면 절대 못 풀었다. 특히 S가 0일 경우? 실전에서 생각할 수 있으려나