an activity, you can change a X to an O, or an O to a X. Allow k to signify the all out number of tokens in the network. Your undertaking is to make the lattice an attract all things considered ⌊k3⌋ (adjusting down) tasks. You are not needed to limit the number of tasks.
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science.
In an activity, you can change a X to an O, or an O to a X. Allow k to signify the all out number of tokens in the network. Your undertaking is to make the lattice an attract all things considered ⌊k3⌋ (adjusting down) tasks.
You are not needed to limit the number of tasks.
Input
The main line contains a solitary integer t (1≤t≤100) — the number of experiments.
The principal line of each experiment contains a solitary integer n (1≤n≤300) — the size of the lattice.
The accompanying n lines each contain a line of n characters, signifying the underlying lattice. The character in the I-th line and j-th section is '.' if the cell is vacant, or it is the sort of token in the cell: 'X' or 'O'.
It is ensured that not all cells are unfilled.
In the simple form, the character 'O' doesn't show up in the input.
The amount of n across all experiments doesn't surpass 300.
Output
For each experiment, print the condition of the lattice subsequent to applying the activities.
We have evidence that an answer consistently exists. In case there are various arrangements, print any.
Step by step
Solved in 4 steps with 1 images
