[20251106] BOJ / G1 / 계단 수 / 한종욱 #1330
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://www.acmicpc.net/problem/1562
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
인접한 모든 자리의 차이가 1치면서 0~9까지 모두 등장한 수의 개수를 세라
🔍 풀이 방법
상태정의를
dp[N번째 자리][마지막 수][여태까지의 체크한 수]로 표현하고 더했다.⏳ 회고
<< 연산자 순위를 잘 모를 땐, 그냥 ()로 다 묶어서 명시하자. C 선생과 같이 풀었는데 비슷한 문제를 많이 풀어봐야 체화가 될꺼 같다. 그래도 재밌었다.