[20251028] BOJ / G5 / 주사위 / 이준희 #1247
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/1041
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
주사위 N^3개를 이용해 NNN 크기의 정육면체를 만들었을 때
아랫면을 제외한 면에 보이는 숫자들의 합이 최소인 경우를 구하는 문제입니다.
🔍 풀이 방법
각각 1면만 보이는 주사위의 갯수, 2면이 보이는 주사위의 갯수, 3면이 보이는 주사위의 갯수를 구해서, 각 경우의 최솟값을 곱해서 구했습니다.
⏳ 회고
머리로 풀려다가 3면만 보이는 경우 쌍을 잘 못찾아서 삽질했습니다