[20251215] BOJ / G5 / 넴모넴모 (Easy) / 이준희#1678
Merged
ShinHeeEul merged 1 commit intomainfrom Dec 15, 2025
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/14712
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
격자 모양의 각 칸에 넴모를 놓거나 안놓거나 할 수 있습니다.
이 때 2*2가 뭉치지 않게 놓을 수 있는 모든 경우의 수를 구하는 문제입니다.
🔍 풀이 방법
백트래킹을 이용해서 모든 경우의 수를 채워가면서
2*2가 아닌 경우만 더해줬습니다.
어차피 현재 상태에서 검증만 하면 됐기 때문에 모든 경우를 다 세도 됐습니다.
⏳ 회고
처음에 예제를 머리로 풀어봤는데 이상하다고 생각했었는데
대각선인 경우를 생각을 안했었습니다