[20251206] BOJ / G5 / 숫자고르기 / 김민진 #1602
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.
🧷 문제 링크
숫자고르기
🧭 풀이 시간
15분
👀 체감 난이도
✏️ 문제 설명
행이 2개인 표가 있음
윗 행에서 뽑은 임의의 숫자들과 해당 숫자 바로 아래에 있는 숫자들의 집합이 동일한 경우 중 집합이 가장 큰 경우
🔍 풀이 방법
그래프의 사이클 찾기
첫 행은
1 ~ N이라 그냥 인덱스라고 쳐도 무방해서 두 번째 행만 고려해도 됨⏳ 회고