[20260312] BOJ / G5 / 수 이어 쓰기 2 / 이준희#2017
Merged
ShinHeeEul merged 2 commits intomainfrom Mar 12, 2026
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/1790
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
1 ~ n 까지의 자연수를 쭉 이어쓴 숫자 에서 (123456789101112...) k번째 숫자가 무엇인지 찾는 문제입니다.
🔍 풀이 방법
단계별로 접근하였습니다.
우선 첫번째로 한자리수 칸인지, 두자릿수 칸인지, 세자릿수 칸인지... 를 찾았습니다.
다음에 각 자릿수칸에서 몇번째 숫자에 포함되어 있는지 찾은 후
해당 숫자 칸에서 몇번째 인덱스의 숫자를 가리키는지 찾아서 출력했습니다.
⏳ 회고
숫자가 너무 커서 접근 방법을 떠올리는 것이 어려웠습니다.