First, find all the pictures.
4-3 |
4-2 |
4-4 |
4-1 |
4-0 |
54-4 |
54-0 |
54-1 |
54-2 |
54-3 |
3-4 |
3-3 |
3-2 |
3-0 |
3-1 |
36-1 |
36-3 |
36-0 |
36-2 |
36-4 |
32-1 |
32-2 |
32-3 |
32-0 |
32-4 |
38-3 |
38-4 |
38-1 |
38-2 |
38-0 |
66-0 |
66-3 |
66-2 |
66-1 |
66-00 |
10-0 |
10-1 |
10-4 |
10-3 |
10-2 |
24-4 |
24-3 |
24-5 |
24-2 |
24-6 |
37-4 |
37-1 |
37-3 |
37-2 |
37-0 |
Treat each picture as a bit. Each picture of a floor is a 0, and each picture of a ceiling is a 1. Order each row by floor (low-order bits are low floors), and order the rows by building number.
Read off the answer, with A=1, etc.:
Building | Binary | Letter |
---|---|---|
3 | 00101 | E |
4 | 01110 | N |
10 | 00100 | D |
24 | 01111 | O |
32 | 10011 | S |
36 | 00011 | C |
37 | 01111 | O |
38 | 10000 | P |
54 | 01001 | I |
66 | 00011 | C |
The answer is ENDOSCOPIC.
2006 MIT Mystery Hunt