codeforces 118B Present from Lena

本文介绍了一个用于生成特殊手帕图案的C语言程序。该程序根据输入的整数n生成一个由数字0到n组成的菱形图案,中心为n,向边缘递减。文章提供了完整的代码实现,并通过示例展示了不同n值时的图案效果。

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

点击打开链接

B. Present from Lena
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Examples
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<stdio.h>
int main()
{
    int n,i,j;
    scanf("%d",&n);
    for(i=0; i<=n; i++)
    {
        for(j=0; j<(n-i)*2; j++)
            printf(" ");
        if(i==0)
            printf("0");
        else
        {
            int s=0;
            for(j=0; j<=i; j++)
                printf("%d ",s++);
            s--;
            for(j=0; j<i; j++)
            {
                if(j==i-1)
                    printf("%d",--s);
                else
                    printf("%d ",--s);
            }
        }
        printf("\n");
    }
    for(i=n-1; i>=0; i--)
    {
        for(j=(n-1)*2+1; j>=i*2; j--)
            printf(" ");
        if(i==0)
            printf("0");
        else
        {
            int s=0;
            for(j=0; j<=i; j++)
                printf("%d ",s++);
            s--;
            for(j=0; j<i; j++)
            {
                if(j==i-1)
                    printf("%d",--s);
                else
                    printf("%d ",--s);
            }
        }
        printf("\n");
    }
    return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值