[20260201] BOJ / G5 / 로마 숫자 / 이준희 #1867
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/2608
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
로마숫자와 아라비아 숫자 2개가 주어지면
두 수의 합을 각각 아라비아 숫자, 로마 숫자로 출력하는 문제입니다.
🔍 풀이 방법
주어진 로마숫자 표기법에 따라서 경우의 수를 전역으로 설정한 후
주어진 규칙에 맞게 아라비아 숫자로 변환하여 더했습니다.
아라비아 -> 로마 / 로마 -> 아라비아 로 변환하는 메소드를 각각 두어 처리했습니다.
⏳ 회고
간단한 구현 문제였습니다.