[20251005] BOJ / G4 / 타일 채우기 / 김민진 #1043
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.
🧷 문제 링크
타일 채우기
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
3 x N배열에2 x 11 x 2타일을 채울 수 있는 경우의 수🔍 풀이 방법
홀수는 무조건 0
짝수는 점화식 세우면 되는데
솔직히 경우의 수 구하는 거 너무 귀찮아서 6이랑 8은 찾아봄 ㅎ
⏳ 회고
기차타고싶다