1. One-Two-Three-Four
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

The image shows a grid containing two sets of 4 highlighted cells, which are populated with the numbers 1, 2, 3, 4 and 4, 3, 2, 1, respectively.

Fill the empty cells with integers from 1 to 4 such that, for each highlighted cell in the top set, there is a path to the corresponding highlighted cell in the bottom set (containing the same number) that moves only through cells containing that same number. You may not change the numbers already present in the highlighted cells.

From any given cell, you may move to an adjacent cell (up, down, left, or right) only if that cell contains the same number.

In the answer field, provide exactly 8 rows, each containing 7 numbers. Do not include any extra text! When submitting your solution, select the language "PHP" (you do not need to know PHP, it's just a feature of the system).

Scoring

Each valid path between a pair of identical numbers in the highlighted cells is worth 25 points. The maximum score for this problem is 100.

Note

For convenience, you may use spreadsheet software (such as Microsoft Excel or LibreOffice Calc) to fill in an 8x7 grid, then select the filled area and copy it into the answer field.