|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||512 MB||16||8||8||50.000%|
A New Alphabet has been developed for Internet communications. While the glyphs of the new alphabet don’t necessarily improve communications in any meaningful way, they certainly make us feel cooler.
You are tasked with creating a translation program to speed up the switch to our more elite New Alphabet by automatically translating ASCII plaintext symbols to our new symbol set.
The new alphabet is a one-to-many translation (one character of the English alphabet translates to anywhere between 1 and 6 other characters), with each character translation as follows:
For instance, translating the string “Hello World!” would result in:
Note that uppercase and lowercase letters are both converted, and any other characters remain the same (the exclamation point and space in this example).
Input contains one line of text, terminated by a newline. The text may contain any characters in the ASCII range 32–126 (space through tilde), as well as 9 (tab). Only characters listed in the above table (A–Z, a–z) should be translated; any non-alphabet characters should be printed (and not modified). Input has at most 10 000 characters.
Output the input text with each letter (lowercase and uppercase) translated into its New Alphabet counterpart.
All your base are belong to us.
@11 `/0|_||Z 8@$3 @|Z3 8310\6 ']['0 |_|$.
What's the Frequency, Kenneth?
\/\/[-]@'][''$ ']['[-]3 #|Z3(,)|_|3\(`/, |<3\\3']['[-]?
A new alphabet!
@ \3\/\/ @1|D[-]@83']['!