[BOJ 9289] Morse Code

View as PDF

Submit solution

Points: 1
Time limit: 1.0s
Memory limit: 128M

Problem types
Allowed languages
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text

Morse code was an early method of communication via electronic signals. Each letter and number was represented by a unique series of long and short tones, with a pause to indicate the beginning of the next character. Implement a Morse Code interpreter, using the key to the right, that translates five-letter messages (no more, no less).

입력 형식

The first line of input is the number of test cases that follow.</p>

Each input case appears on a single line, and will include five Morse code characters, a space-separated series of long and short tones, represented by dots and dashes.

There will be at most 1000 test cases.

출력 형식

For each case, output the line “Case x:” where x is the case number, on a single line. Then output a single space followed by an all-caps alphanumeric representation of the message, exactly five characters in length.

예제 입력

5
... ..- .--. . .-.
... .- .-.. .- -..
--.- ..- . ... ---
-.. .. ... -.-. ---
-. -.-- .-.. --- -.

예제 출력

Case 1: SUPER
Case 2: SALAD
Case 3: QUESO
Case 4: DISCO
Case 5: NYLON

Comments

There are no comments at the moment.