Начало
Соревнования
Metamorphoses
Реализация заданного алгоритмаОлимпиадные задачи на русском языке
Алгоритмы и классы STL
| 26/04/2002 | 6-й Чемпионат Урала. 2 тур (8) |
| 03/07/2006 | Лето 2006 дорешивание ( 1B) |
| 03/07/2006 | Лето 2006 - 1 (B) |
| 12/09/2007 | Занятие 1 (C) |
| 12/09/2009 | Занятие 1 (E) |
| 15/10/2010 | Занятие 6 (A) |
| 02/07/2013 | Лето 2013-2 (H) |
Ограничения: время – 250ms/500ms, память – 64MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод 
Послать решение Blockly Посылки Темы Где Обсудить (0)
Take two words of equal length, for example, SEAT and TALE, write them one under another and make the following transformations. At first, replace all appearances of the first character of the second word in the second word with the first character of the first word, and all appearances of the first character of the first word in the first word with the first character of the second word. Similarly, all appearances of the second character of the second word in the second word with the second character of the first word, and all appearances of the second character of the first word with the first word on the second character of the second word. The same must be done for the third pair of characters of the both words, and so on for all characters from left to right.
SEAT TEAT TAAT TLLT ELLETALE SALE SELE SEAE STAT
Write the program, which calculates outcome of transformations for the pair of the given words.
Input
Input file contains two lines. Each line contains one word, the length of which is not more than 100 characters consisting of uppercase letters from A through Z. Both words have equal length.
Output
Write into the output file two lines containing the outcome of transformations. On the first line write the transformed first word, and on the second line write the transformed second word.
Sample Input
SEAT TALE
Sample Output
ELLE STAT
