题库练习 Present from Lena
← 上一题 下一题 →

A8365 | Present from Lena

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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
0 1 0
0 1 2 1 0
0 1 2 3 2 1 0
0 1 2 3 4 3 2 1 0
0 1 2 3 4 5 4 3 2 1 0
0 1 2 3 4 3 2 1 0
0 1 2 3 2 1 0
0 1 2 1 0
0 1 0
0
```

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

输入格式

The first line contains the single integer $n$ ( $2<=n<=9$ ).

输出格式

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.

输入输出样例

输入 #1
2
输出 #1
    0
  0 1 0
0 1 2 1 0
  0 1 0
    0
输入 #2
3
输出 #2
      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
C++ 编辑器
输入
输出