| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 128 MB | 40 | 17 | 14 | 53.846% |
Mirko is, as we know, happily married. During the last month he gained 70 pounds. Because of all the fat stored in his fingers, he has a hard time writing e-mails to his old friend Slavko whom he has not forgotten.
Every night Mirko describes in detail all the things he has eaten on that day, but sometimes he presses more than one key when he only wanted to press one. Every of those accidentally pressed keys can be any key on the keyboard, including the desired key, the keys may repeat and, since Mirko has already gotten used to his disability, the number of accidentally pressed keys along with the desired one will not be more than three.
After he received multiple unreadable e-mails, Slavko asked Mirko to always send e-mail three times so that he can understand it more easily.
Write a program that will help Slavko to determine the longest possible text that Mirko could of written, based on the three e-mails he received.
The input file contains 3 lines of text.
Each of those lines contains one version of Mirko's text. The only characters contained will be non-capital letters of the English alphabet and there won't be more than 100 of them.
The first and only line of the output data should contain the longest possible text that Slavko could determine from the received e-mails.
Note: There will always be a solution, but not necessarily a unique one.
jueha judbhak jukhxa
juha
asaermxvqav scanrmab tstamrmhaqu
sarma
cecqbhvaiaedpibaluk cabegviapcihlaaugck adceevfdadaepcialaukd
cevapiluk