Maybe you can't quite dance like an egyptian, but you can build a Pyramid!
In what concerns the continuous evaluation solving exercises grade during the semester, you should submit until 23:59 of March 24th
(this exercise will still be available for submission after that deadline, but without couting towards your grade)
[to understand the context of this problem, you should read the class #03 exercise sheet]
Maybe you can't quite dance like an egyptian, but you can build a Pyramid!
Write a program that, given several odd integers, draws for each one a pyramid of that size.
For a given number N, the pyramid should have exactly N lines, each one more '#' character than the previous one. All lines should have the same number of characters as the previous one (pad the extra positions with the character '.').
For example, for N=5 the output should be:
....#.... ...###... ..#####.. .#######. #########
The first line of input contains an integer T, representing the number of test cases that follow.
Each of the following T lines contains one odd integer N, representing the size of the pyramid that we want to draw.
The output should have exactly T pyramids, one per input test case, as explained on the problem section.
The following limits are guaranteed in all the test cases that will be given to your program:
| 1 ≤ T ≤ 5 | Number of test cases | |
| 3 ≤ N ≤ 999 | Size of the pyramid |
| Example Input | Example Output |
3 5 3 7 |
....#.... ...###... ..#####.. .#######. ######### ..#.. .###. ##### ......#...... .....###..... ....#####.... ...#######... ..#########.. .###########. ############# |