[BOJ 9783] Easy Encryption

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

In order to send a secret message to your friend, you invent an original method to encrypt the message. The encryption rule is quite simple. A letter is replaced with 2-digit number. Each letter has its corresponding number as the following:</p>

a = 01, b = 02, c = 03, ..., y = 25, z = 26
A = 27, B = 28, C = 29, ..., Y = 51, Z = 52

Every numeric character (0-9) that appears in the original message will be prefixed by #. All other characters will not be changed.

입력 형식

The input message is composed of a string containing less than 128 characters.

출력 형식

Print out the encrypted message.

예제 입력

Meet in library at 10:45 AM.

예제 출력

39050520 0914 12090218011825 0120 #1#0:#4#5 2739.

Comments

There are no comments at the moment.