[백준 1251][Python] 다리나누기

문제 링크 https://www.acmicpc.net/problem/1251

풀이

word = list(input())
result = []
tmp = list()
for i in range(1, len(word)-1):
    for j in range(i + 1, len(word)):
        a = word[:i]
        b = word[i:j]
        c = word[j:]
        a.reverse()
        b.reverse()
        c.reverse()
        tmp.append(a + b + c)

for a in tmp:
    result.append(''.join(a))

print(sorted(result)[0])