A1340.[COCI-2007_2008-contest4]#2 LEKTIRA
普及/提高-
通过率:0%
时间限制:1.00s
内存限制:128MB
题目描述
Mario is making up silly games again instead of reading Dostoevsky for school. The rules of his newest game follow.
First he chooses a random word from the book. Then he splits the word in two arbitrary places to get three separate words.
After that he reverses the order of the letters in each of those three words (exchanges the first and last letters, the second and second last and so on).
Finally, he puts the three words back together in the same order in which they were before splitting.
The goal of the game is to obtain the lexicographically smallest word possible. In other words, of all words that can be obtained by the above procedure, find one which would be earliest in a dictionary.
Write a program that plays Mario's game perfectly.
输入格式
The first and only line of input contains Mario's chosen word, a string of lowercase letters of the English alphabet with no spaces.
The input word will be between 3 and 50 characters long (inclusive).
输出格式
Output the best word on a single line.
输入输出样例
输入#1
dcbagfekjih
输出#1
abcdefghijk
输入#2
mobitel
输出#2
bometil
输入#3
anakonda
输出#3
aanadnok