CF118B.Present from Lena
入门
通过率:0%
时间限制:2.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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.
瓦西娅的生日快到了,莉娜决定为他缝制一条印有数字图案的手帕作为礼物。莉娜选用了从 0 到 n 的数字作为图案,这些数字将构成一个菱形:最大的数字 n 位于中心;越靠近边缘,数字越小。例如,当 n=5 时,手帕的图案应如下所示:
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
你的任务是:给定 n,输出该手帕对应的图案。
输入格式
The first line contains the single integer n (2 ≤ n ≤ 9).
第一行包含一个整数 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.
根据给定的 n 输出一幅图案。你必须严格遵守每行第一个数字前的空格数量。同一行中每两个相邻数字之间应恰好用一个空格分隔。每行末尾最后一个数字之后不得有空格。
输入输出样例
输入#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
输入解题思路,AI测评打分。不知道怎么写?