logic puzzle

[Snail]

Am gasit urmatorul puzzle foarte interesant:

During the recent BrainBashers cipher convention, a binary code contest took place.

The contest consisted of a binary code transmission where the spaces between the letters were missing and there was no punctuation.

Each letter of the alphabet was translated into its binary equivalent based on its position in the alphabet:

a=1, b=10, c=11, d=100, e=101, f=110, g=111, h=1000, i=1001, j=1010, k=1011, l=1100, m=1101, n=1110, o=1111, p=10000, q=10001, r=10010, s=10011, t=10100, u=10101, v=10110, w=10111, x=11000, y=11001, z=11010.

What is the answer to the question being asked?

110011101001000100110011100110011110110

101100101100110010011101101001111010111

001010010000101011101011010110010110011

010010001111101011111000101001001101001

011111111010111001001000101110010000100

111010011100111011101100110011100111011

000011001011000110101101100111010010011

111111010111100011010010011001111111110

101100001100101011001111111110101

Ma gandesc daca poate cineva sa il faca.

PS:Eu am incercat dar m-am dat batut dupa primul rand.

[quadxenon]

As this is a very difficult puzzle, I thought it would help if I asked a simple question: What is one plus one?

[pr00f]

Sirul de mai sus se poate descifra prin algoritmul Hoffman, un sir de inceput fiind

asthdyysmurllimtgultpbkuurythcnwxtitwouldhelpdnilnnlyymparxzmstionwqtdlooupljloou

... fara optimizarea arborului. Se poate observa subsirul ``itwouldhelp'', precum si ``stion'' ce poate veni de la ``question'', ambele subsiruri facand parte din ``I thought it would help if I asked a simple question''.

@Usr6 Initial comparasem lungimea sirului de mai sus cu cea a sirului descifrat, si imi lipseau 5 caractere, de unde problema mea. Nu m-am gandit sa incerc direct raspunsul oferit .

Edited March 23, 2015 by pr00f

[Usr6]

@quadxenon in binar folosind dictionarul:

a=1, b=10, c=11, d=100, e=101, f=110, g=111, h=1000, i=1001, j=1010, k=1011, l=1100, m=1101, n=1110, o=1111, p=10000, q=10001, r=10010, s=10011, t=10100, u=10101, v=10110, w=10111, x=11000, y=11001, z=11010.

dupa ce ai terminat traducerea, compara cu ce trebuie decodat si dai omului un like

// L.E.

... Nu m-am gandit sa incerc direct raspunsul oferit .

Nici eu, byte-ul e de vina

Edited March 23, 2015 by Usr6