Present from Lena

为庆祝Vasya的生日,Lena决定送给他一块带有图案的手帕作为礼物。手帕上的图案由数字组成,形成一个菱形,最大的数字位于中心,并且从中心向外逐渐减小。本篇介绍如何根据给定的最大数字n来确定手帕的最终图案。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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.

Input

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

Output

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 test(s)
Input
2
Output
    0
  0 1 0
0 1 2 1 0
  0 1 0
    0
Input
3
Output
      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
#include<iostream>
#include<cstdio>
using namespace std;

int main()  {
    int n,m,i,j;
    while(cin>>n){
        m=2*n+1;
        for(i=0;i<m;i++){
            if(i<n){
                for(j=(n-i);j>0;j--){
                    printf("  ");
                }
                for(;j<i;j++){
                    printf("%d ",j);
                }
                for(;j>=0;j--){
                    if(j!=0){
                        printf("%d ",j);
                    }
                    else{
                        printf("%d",j);
                    }
                }
            }
            if(i==n){
                for(j=0;j<n;j++){
                    printf("%d ",j);
                }
                for(;j>=0;j--){
                    if(j!=0){
                        printf("%d ",j);
                    }
                    else{
                        printf("%d",j);
                    }
                }
            }
            if(i>n){
                for(j=(i-n);j>0;j--){
                    printf("  ");
                }
                for(j=0;j<(m-i-1);j++){
                    printf("%d ",j);
                }
                for(;j>=0;j--){
                    if(j!=0){
                        printf("%d ",j);
                    }
                    else{
                        printf("%d",j);
                    }
                }
            }
            printf("\n");
        }
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值