[20260226] BOJ / G5 / A와 B 2 / 이준희#1973
Merged
ShinHeeEul merged 1 commit intomainfrom Feb 26, 2026
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/12919
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
문자열 S와 T가 주어지고
S에는 아래의 두가지 연산을 할 수 있습니다.
주어진 조건을 이용해서 S를 T로 만들 수 있으면 1 없으면 0을 출력하는 문제입니다
🔍 풀이 방법
T에서부터 시작하여 A를 없애거나 뒤집어서 B를 없애가며 단계를 줄여나가면서
S와 같은 길이가 되었을 때 S와 같은지 검증했습니다
⏳ 회고
S에서부터 시작하지 않고 T에서부터 돌아가는 것이 키포인트였습니다.