consider cells of a square network n×n as contiguous in the event that they have a typical side, that is, for cell (r,c) cells (r,c−1), (r,c+1), (r−1,c) and (r+1,c) are nearby it. For a given number n, build a square lattice n×n to such an extent that: Every integer from 1 to n2 happens in this network precisely once;
Correct answer will be upvoted else downvoted.
We will consider cells of a square network n×n as contiguous in the event that they have a typical side, that is, for cell (r,c) cells (r,c−1), (r,c+1), (r−1,c) and (r+1,c) are nearby it.
For a given number n, build a square lattice n×n to such an extent that:
Every integer from 1 to n2 happens in this network precisely once;
On the off chance that (r1,c1) and (r2,c2) are contiguous cells, the numbers written in them should not be neighboring.
Input
The principal line contains one integer t (1≤t≤100). Then, at that point, t experiments follow.
Each experiment is characterized by one integer n (1≤n≤100).
Output
For each experiment, output:
- 1, if the necessary network doesn't exist;
the necessary lattice, in any case (any such network if a significant number of them exist).
Step by step
Solved in 3 steps with 1 images
