Question

During the recent 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 Can you find 10 countries? 101011000011110 101111110010110011 100001111110011110100 110100101111011101 11100010011100101 1101111110010111111111111 11010111011010011 10100110011011111110 1000011110111011 1101111111101111111110010011

Answer 1

The answer is 2..........................................