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
1 participant
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/11057
🥺 무엇을 알게 되었나요?
어제 푼 문제랑 비슷하긴 한데
이거는 맨 앞에 0이 올 수 있다.
그리고 숫자가 하나씩 차이나는게 아니라, 계속 커지기만 하면 되는 것이기 때문에
다음 dp를 구할때 만약 i번째 자리의 8 경우의수라고 하면 d[i][8] = d[i-1][8이랑 9] 이렇게 되므로, 결국 이전 자리(i-1) 자기 자신(j)부터 끝까지의 합을 항상 더해주면 된다.