4220.Present from Lena

Time Limit: 1s Memory Limit: 256MB

Vasya's birthday is approaching and Lena decided to sew a patterned handkerchief to him as a present. Lena chose digits from 0 to n as the pattern. The digits will form a rhombus. The largest digit n should be located in the centre. The digits should decrease as they approach the edges. For example, for n=5 the handkerchief pattern should look like that:

0
010
01210
0123210
012343210
01234543210
012343210
0123210
01210
010
0

Your task is to determine the way the handkerchief will look like by the given n.

Input Format(From the terminal/stdin)

The first line contains the single integer n (2 \le n \le 9).

Output Format(To the terminal/stdout)

Print a picture for the given n. You should strictly observe the number of spaces before the first digit on each line. Every two adjacent digits in the same line should be separated by exactly one space. There should be no spaces after the last digit at the end of each line.

Sample Input 1

Copy
2
 \n

Sample Output 1

Copy
 0 0 1 0
0 1 2 1 0 0 1 0 0
· · · · \n
 · · · · · · · · \n

Sample Input 2

Copy
3
 \n

Sample Output 2

Copy
 0 0 1 0 0 1 2 1 0
0 1 2 3 2 1 0 0 1 2 1 0 0 1 0 0
· · · · · · · · · \n
 · · · · · · · · · · · · · · · \n

Submit

请先 登录

© 2025 FAQs