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>
using namespace std;
void PresentfromLena()
{
int k = 0;
cin>>k;
for (int i = 0; i <= k; i++)
{
int space = k - i;
for (int j = 0; j < space; j++)
{
cout<<" ";
}
for (int j = 0; j <= i; j++)
{
cout<<j;
if (0 != i) cout<<‘ ‘;
}
for (int j = i - 1; j >= 0 ; j--)
{
cout<<j;
if (j != 0) cout<<‘ ‘;
}
cout<<endl;//不要遗忘了换行符
}
for (int i = k - 1; i >= 0 ; i--)
{
int space = k - i;
for (int j = 0; j < space; j++)
{
cout<<" ";
}
for (int j = 0; j <= i; j++)
{
cout<<j;
if (0 != i) cout<<‘ ‘;
}
for (int j = i - 1; j >= 0 ; j--)
{
cout<<j;
if (j != 0) cout<<‘ ‘;
}
cout<<endl;
}
}
codeforce Present from Lena 打印菱形,码迷,mamicode.com