CodeForces 118B Presentfrom Lena

[题目链接] (http://codeforces.com/problemset/problem/118/B)

---

Description

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.

---

Iput

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 Input

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

---

题意：
额额，没什么好讲的啊，真心水的一逼，不过有一点要注意哦，最后输出0时后面无空格，直接换行（倒福啦，像不像(^o^)/~）

---

 代码如下：

#include <stdio.h>
void fun(int x)
{
    int i;
    printf("0");
    if (x!=0)
    {
        for (i=1;i<x;i++)
            printf(" %d",i);
        for (i=x;i>=0;i--)
            printf(" %d",i);
    }
    printf("\n");
}
int main()
{
    int n,i,j;
    scanf("%d",&n);
    for (i=0;i<n;i++)
    {
        for (j=(n-i)*2;j;j--)
            printf(" ");
        fun(i);
    }
    for (i=n;i>=0;i--)
    {
        for (j=(n-i)*2;j;j--)
            printf(" ");
        fun(i);
    }
    return 0;
}