[20250217] BOJ / 골드4 / DSLR / 설진영 #135
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
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
특정 숫자에 어떤 연산을 해서 어떤 값 도출하기, 값은 무조건 나온다 가정할때
🔍 풀이 방법
BFS로 가능한 경우를 모두 탐색하다, 값이 나오는 경우 지나온 연산을 모두 출력하면 된다
⏳ 회고
BFS인거 알면서 바로 재귀를 짜고 있는 나... BFS도 좀 익숙해지자
어떤것을 기준으로 방문 여부를 관리할지에 대해 고민하기. 스택오버플로우 터지면 방문 처리를 하지 않았는지 점검하기
문제 조건 제대로 읽기 -> 4자리인지 뒤늣게 발견함