| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 86649 | 汤弘毅 | 打印数字图形 | Python3 | Wrong Answer | 33 MS | 3800 KB | 407 | 2024-07-27 09:39:56 |
n = int(input()) s = [] ln = n*2-1 for i in range(1,n+1): s.append([str(x) for x in range(1,i)]+[str(x) for x in range(i,0,-1)]) for i in range(n-1,0,-1): s.append([str(x) for x in range(1,i)]+[str(x) for x in range(i,0,-1)]) for p in range(1,n+1): lst = [' ']*(n-p)+s[p-1] print(' '.join(lst)) for p in range(n-1,0,-1): lst = [' ']*(n-p)+s[ln-p] print(' '.join(lst))
------Input------
8
------Answer-----
1 121 12321 1234321 123454321 12345654321 1234567654321 123456787654321 1234567654321 12345654321 123454321 1234321 12321 121 1
------Your output-----
1 1 2 1 1 2 3 2 1 1 2 3 4 3 2 1 1 2 3 4 5 4 3 2 1 1 2 3 4 5 6 5 4 3 2 1 1 2 3 4 5 6 7 6 5 4 3 2 1 1 2 3 4 5 6 7 8 7 6 5 4 3 2 1 1 2 3 4 5 6 7 6 5 4 3 2 1 1 2 3 4 5 6 5 4 3 2 1 1 2 3 4 5 4 3 2 1 1 2 3 4 3 2 1 1 2 3 2 1 1 2 1 1