[20260127] BOJ / G4 / 음식 평론가 / 이준희 #1845
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
JHLEE325
changed the title
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/1188
🧭 풀이 시간
15분
👀 체감 난이도
✏️ 문제 설명
소세지 N개를 M명의 음식 평론가에게 똑같은 크기로 나눠주려고 할 때 소세지를 자르는 최소 횟수를 구하는 문제입니다.
🔍 풀이 방법
소세지를 하나의 긴 소세지라고 했을 때 나눠야 하는 (M-1)회 중 이미 개별의 소세지로 나누어진 경우(공약수)를 뺐습니다.
⏳ 회고
간단한 문제였습니다.