Problem of the day
For 'N' : 4
Pattern :
4 3 2 1 2 3 4
3 3 2 1 2 3 3
2 2 2 1 2 2 2
1 1 1 1 1 1 1
2 2 2 1 2 2 2
3 3 2 1 2 3 3
4 3 2 1 2 3 4
The first input line contains an integer 'T', the number of test cases. Then 'T' test cases follow.
The first and the only line of input contains the integer 'N'.
For each test case print the Magical Pattern as shown in the example.
You don't need to print anything. It has already been taken care of, just implement the given function.
1 <= T <= 10
1 <= N <= 10^2
Time Limit : 1 sec
1
3
3 2 1 2 3
2 2 1 2 2
1 1 1 1 1
2 2 1 2 2
3 2 1 2 3
1
5
5 4 3 2 1 2 3 4 5
4 4 3 2 1 2 3 4 4
3 3 3 2 1 2 3 3 3
2 2 2 2 1 2 2 2 2
1 1 1 1 1 1 1 1 1
2 2 2 2 1 2 2 2 2
3 3 3 2 1 2 3 3 3
4 4 3 2 1 2 3 4 4
5 4 3 2 1 2 3 4 5