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/13250
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
주사위를 여러 번 던지고 그 합을 통해 사탕 개수를 얻는다. 사탕 N을 구하기 위해 던져야하는 횟수의 기댓값을 출력.
🔍 풀이 방법
dp, k번 던질 때 그 이전 횟수를 이용.
⏳ 회고
기댓값에 대해 까먹어서 좀 찾아봤고 문제를 완벽히 이해해서 수식을 세웠다기 보다 예시를 이용해서 푼 느낌. 특정 순간의 기댓값을 구할때 주사위를 이미 한번 던져야 그 값을 논할 수 있다는 게 수식의 핵심이었다.