Parity ControlVolumes: String Tricks
Anna lives at Algol and Bob lives at Betelgeuse. Long distance separates them since these stars are in different constellations - Perseus and Orion.
They found a way to communicate via e-mail. However, due to big distance, some letters could be changed during transmission. Simple form of error-check is proposed by Anna:
All letters are transmitted in usual ASCII code, one byte per symbol. Each byte consists of 8 bits, but
the highest bit is not used for English language - it is normally always
Let us write to this bit either
1 in order that sum of bits in the whole byte is always even (
8). Thet is how some letters are encoded:
symbol ascii-code binary num-of-bits encoded-binary encoded-dec 'A' 65 01000001 2 01000001 65 'B' 66 01000010 2 01000010 66 'C' 67 01000011 3 11000011 195 '.' 46 00101110 4 00101110 46 ' ' 32 00100000 1 10100000 160
It is supposed that communication line could not change more than one bit in each of the transmitted bytes.
You are given the message in this protected encoding. Your task is to check each letter and remove those which are corrupted. Others should be converted to normal ASCII and printed as characters.
Input data will contain bytes of the message transmitted (represented by the sequence of decimal values,
separated with spaces). Original message consists only of latin letters (small and capital), digits and spaces.
The end of message is signalled by dot character
'.' - you can assume this will never be corrupted.
Answer should contain message with corrupted bytes removed, highest bits cleared - and represented as characters rather than numbers. For example:
input data: 65 238 236 225 46 answer: Ana.