Problem 33 - Parity Control

Hey All,

I'm working on Parity control but I keep getting the answer wrong. There's a part of the problem that reads:

Answer should contain message with corrupted bytes removed, highest bits cleared - and represented as characters rather than numbers.

What does "highest bits cleared" actually mean? It's not so much a coding problem I'm having, rather I don't understand the question.

This is causing my answer to contain extra characters as below:

Expected Answer: meMSZkFnXr FoWvmuLRdixa8NmTnlfnp 5CZiH2FV0ZQj R66 n58mgt c8Qa JT L.

My Answer: JmQeM5SZkFnXrb 1FvoWvmuhLRdixa8NmTIDpUnlfnp 5CZimH2FV0ZQjb RE66 B n5R8mgJltv c8Qa JtT uL.

I thought maybe it meant to just remove the highest number, but the example answer given is:

input data: 65 238 236 225 46

answer: Ana.

So, this means that 65 = A, 238 = n, 236 = l, 255 = a and 46 = .

How do I know how to identify the extra character? The example answer means it's l, which is 236 and not the highest number.

Thanks :D

(this is driving me absolutely nuts.)

If it helps here is my code:

import re
x = input("Input: ")
x = re.findall(r"[0-9]+",x)
x = [int(x) for x in x]
end = []
for _ in range(len(x)):
    a = x.pop(0)    
    if a > 122: 
        a -= 128
    if (a >= 48 and a <= 57) or (a >= 64 and a <= 90) or (a >= 97 and a <= 122) or (a == 46) or (a == 32):
        num = bin(a).replace("b","")
        letter = "".join([chr(int(binary, 2)) for binary in num.split(" ")])
        end.append(letter)
print("".join(end))

Thanks man, think I'm going to give up on this one for now then. I went with just removing 128 from any interger more than 122 as that would count for that extra byte, it'll need a whole re-work.

Thanks again for the help.

i must be losing my mind.

Input: 65 238 236 225 46
0b1000001
0b11101110
0b11101100
0b11100001
0b101110
Anla.

How can you tell which one is corrupted from the above?

Thanks for your help.

I got it :D thanks again!!! All good. There's 3 hours i'll never get back!!