[BOJ 12608] T9 Spelling (Large)

View as PDF

Submit solution

Points: 1
Time limit: 5.0s
Memory limit: 512M

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

The Latin alphabet contains 26 characters and telephones only have ten digits on the keypad. We would like to make it easier to write a message to your friend using a sequence of keypresses to indicate the desired characters. The letters are mapped onto the digits as shown below. To insert the character B for instance, the program would press 22. In order to insert two characters in sequence from the same key, the user must pause before pressing the key a second time. The space character ' ' should be printed to indicate a pause. For example, 2 2 indicates AA whereas 22 indicates B.</p>

입력 형식

The first line of input gives the number of cases, NN test cases follow. Each case is a line of text formatted as</p>

desired_message

Each message will consist of only lowercase characters a-z and space characters ' '. Pressing zero emits a space.

Limits

  • 1 ≤ N ≤ 100.
  • 1 ≤ length of message in characters ≤ 1000.
## 출력 형식

For each test case, output one line containing "Case #x: " followed by the message translated into the sequence of keypresses.

예제 입력

4
hi
yes
foo  bar
hello world

예제 출력

Case #1: 44 444
Case #2: 999337777
Case #3: 333666 6660 022 2777
Case #4: 4433555 555666096667775553

Comments

There are no comments at the moment.