Consider the following 5 picture frames placed on an 9 × 8 array.
........ ........ ........ ........ .CCC....
EEEEEE.. ........ ........ ..BBBB.. .C.C....
E....E.. DDDDDD.. ........ ..B..B.. .C.C....
E....E.. D....D.. ........ ..B..B.. .CCC....
E....E.. D....D.. ....AAAA ..B..B.. ........
E....E.. D....D.. ....A..A ..BBBB.. ........
E....E.. DDDDDD.. ....A..A ........ ........
E....E.. ........ ....AAAA ........ ........
EEEEEE.. ........ ........ ........ ........
1 2 3 4 5
.CCC....
ECBCBB..
DCBCDB..
DCCC.B..
D.B.ABAA
D.BBBB.A
DDDDAD.A
E...AAAA
EEEEEE..
Each input block contains the height, h (h ≤ 30) on the first line and the width w (w ≤ 30) on
the second. A picture of the stacked frames is then given as h strings with w characters each.
Each block contains at least one frame.
The input may contain multiple blocks of the format described above, without any blank lines
in between. All blocks in the input must be processed sequentially. Two lines each containing a
single zero indicate the end of the input.
Write the solution to the standard output. Give the letters of the frames in the order they
were stacked from bottom to top. If there are multiple possibilities for an ordering, list all such
possibilities in alphabetical order, each one on a separate line. There will always be at least one
and at most one thousand legal ordering for each input block. List the output for all blocks in
the input sequentially, with a blank line after each block.
9 8 .CCC.... ECBCBB.. DCBCDB.. DCCC.B.. D.B.ABAA D.BBBB.A DDDDAD.A E...AAAA EEEEEE.. 0 0
EDABC
Migrated from old NTUJ.
| No. | Testdata Range | Score |
|---|