All submissions for this problem are available.
You have to solve a game of Kaleidoscope.
Kaleidoscope consists of 18 pieces, which can be seen here . As you can see in the link, they are like dominoes, with each tile colored black or red. Each has been given a letter from 'A' - 'R' as in the image. The total number of tiles is 8*8 = 64.
You have to arrange these pieces, possibly by rotating them by 90, 180 or 270 degrees, but not flipping them. You have to arrange them together so that they come into an 8X8 formation, to obtain certain configurations. For example, the pieces can be put together like this - sample . This image also corresponds to the sample input-output, so refer to that.
The description of the 18 pieces is the same for every game. Given a configuration, output a possible arrangement. (Refer to I/O specifications)
See the input-output specifications for more understanding.
An input file contains the target formulation specified as an 8X8 grid of 1's and 0's. A 0 corresponds to a red square, and a 1 corresponds to a black square. You are required to solve that board, that is find the placement of the tiles to get that formulation.
Output your solution (any possible solution if many exist), as an 8X8 grid that contains in position[i][j] the character corresponding to the piece that fits in that position. For example, in your solution, if the tile 'M' which corresponds to a square comes in the topleft corner, your output will be like this -
See that the square can be put in a
configuration, as well as a
Note that in the output, you don't need to specify the configuration/rotation of the piece. If one of the possible configurations of the piece you have put gives the correct answer, it will be accepted.
There are 10 test files with 1 board each. Your score will be proportional to the number of boards you solve.
Input: 10101010 10010110 01000101 10101010 01010101 10100110 01011011 10010101 Output: JJJJJJJJ MMHHHRII MMLHPCBI ALLQPCBI AAAKKCBN EFKKGGNN EFFFGOON EEDDDDOO
|Time Limit:||3 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.5, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.