[20251005] PGM / LV3 / 주사위 고르기 / 이종환 #1046
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://school.programmers.co.kr/learn/courses/30/lessons/258709
🧭 풀이 시간
54분
👀 체감 난이도
✏️ 문제 설명
문제가 길어서 링크 참조 바람
🔍 풀이 방법
시간 복잡도를 계산해보니, 투포인터?를 적용한 완탐을 진행하면 가능할 것 같아서 그렇게 진행하였다. 전체 케이스가 애초에 최대 10C2 = 45이기에, 충분하다고 판단하였고, 이를 조합을 통해 구현한 결과 성공하였다.
⏳ 회고