[20250428] BOJ / G4 / DSLR / 이강현 #320
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/9019
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
10000미만의 양의 정수에 대하여 4가지 연산을 진행할때 특정 값을 만드는 가장 적은 연산을 출력
🔍 풀이 방법
BFS
⏳ 회고
6초나 주니까 각각의 연산을 매 순간 모두 진행하고 같아질 때 break
BFS로 최소 길이로 만들어지는 게 보장되니까 매 순간 어떤 연산을 통해 만들었는지를 연결하고
마지막에 거꾸로 출력했음.