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.
🧷 문제 링크
비숍
🧭 풀이 시간
70분
👀 체감 난이도
✏️ 문제 설명
이 때 가장 많이 놓을 수 있는 비숍의 갯수는?
🔍 풀이 방법
백트래킹인데 가지치기를 잘 해야함
\대각선은x - y값이 동일하고/대각선은x + y값이 동일하다는 점으로 백트래킹 진행함⏳ 회고
색상별로 백트래킹 진행하면 된다니.......
어차피 대각선으로 움직이니까 다른 색상으로 이동 불가니까.........