[20250916] PGM / LV2 / N-Queen / 김수연 #908
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/12952
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
가로, 세로 길이가 n인 정사각형으로 된 체스판이 있을 때,
체스판 위에 n개의 퀸이 서로를 공격할 수 없도록 배치하는 방법의 수 구하기
🔍 풀이 방법
백트래킹 이용
재귀함수 돌리면서 공격가능 여부 확인하고 depth가 n이 되면 answer하나 늘려줌
⏳ 회고
백준에서 푼거 같다..?