|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||2||0||0||0.000%|
This is an output-only problem.
The chess developers released a new custom mode called "The Last Samurai". On the initial configuration of the board there is one black king and multiple white pieces. The only moving piece is the black king, and the goal is to capture all white pieces without ever putting itself under attack.
Consider a strategy that repeats the following steps:
You need to design a level with the following properties:
Please provide any level satisfying these requirements.
The problem has no input.
In the first line print two space-separated integers $n$ and $m$ ($1\leq n, m\leq 200$) standing for the size of the board. In the next $n$ lines print the level description. More specifically, the $i$-th of them must be a string consisting of characters from "
.rbnkRBNK", where the $j$-th of them is
." if the corresponding cell is free,
r" or "
R" if the corresponding cell is occupied by a white rook,
b" or "
B" if the corresponding cell is occupied by a white bishop,
n" or "
N" if the corresponding cell is occupied by a white knight,
k" or "
K" if the corresponding cell is occupied by the black king.
8 8 r....... ........ ........ ........ .K...... .....b.. ........ ....n...
The sample output is only given to clarify the output format. The greedy strategy captures all pieces in 10 moves, with the king's route shown below: