[20251009] PGM / Lv2 / k진수에서 소수 개수 구하기 / 이강현 #1074
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://school.programmers.co.kr/learn/courses/30/lessons/92335
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
양의 정수를 k진수로 변환하고 0으로 분리되는 값들중 소수가 몇개있는지 구하는 문제
🔍 풀이 방법
k진수로 바꾸고 0으로 split하고 소수 판별하면 됨.
⏳ 회고
n이 백만 이하라서 2진수로 바꿔도 32자리 이내라서 그냥 int를 사용했는데, 생각해보니 2진수로 변환된 값이 10진수 취급이되면 overflow가 나서 long을 사용해야했다.