本题要求你写个程序把给定的符号打印成沙漏的形状。例如给定17个“*”,要求按下列格式打印
*****
***
*
***
*****
所谓“沙漏形状”,是指每行输出奇数个符号;各行符号中心对齐;相邻两行符号数差2;符号数先从大到小顺序递减到1,再从小到大顺序递增;首尾符号数相等。
给定任意N个符号,不一定能正好组成一个沙漏。要求打印出的沙漏能用掉尽可能多的符号。
输入格式:
输入在一行给出1个正整数N(≤1000)和一个符号,中间以空格分隔。
输出格式:
首先打印出由给定符号组成的最大的沙漏形状,最后在一行中输出剩下没用掉的符号数。
输入样例:
19 *
输出样例:
*****
***
*
***
*****
2
代码长度限制
16 KB
时间限制
400 ms
内存限制
64 MB
个人做法
#include<iostream>
using namespace std;
int main()
{
int N = 0, h1 = 0, n = 0, an = 0, h2 = 0, h3 = 0;
char a[46] = { '0' }, b[46] = { '0' }, fu;
cin >> N >> fu;
if (N == 1)
cout << fu;
if (N != 1 && N % 2 == 1)
{
n = (N - 1) / 2;
for (int i = 3; n >= i; i += 2)
{
n = n - i;
h1 += 1;
}
for (h2 = h1; h2 >= 0; h2--)
{
int cn = 1;
for (cn = 1; cn <= 2 * h1 + 1; cn++)
{
int space = h1 - h2;
if (cn <= space || cn >= 2 * h1 + 2 - space)
b[cn] = ' ';
else
b[cn] = fu;
cout << b[cn];
}
cout << endl;
}
int n2 = (N - 1) / 2;
for (int j = 3; n2 >= j; j += 2)
{
n2 = n2 - j;
h3 += 1;
int space2 = h1 - h3;
for (an = 1; an <= 2 * h1 + 1; an++)
{
if (an <= space2 || an >= 2 * h1 + 2 - space2)
a[an] = ' ';
else
a[an] = fu;
cout << a[an];
}
cout << endl;
}
cout << N - h1 * (2 * h1 + 4) - 1;
}
if (N != 1 && N % 2 == 0)
{
n = (N - 2) / 2;
for (int i = 3; n >= i; i += 2)
{
n = n - i;
h1 += 1;
}
for (h2 = h1; h2 >= 0; h2--)
{
int cn = 1;
for (cn = 1; cn <= 2 * h1 + 1; cn++)
{
int space = h1 - h2;
if (cn <= space || cn >= 2 * h1 + 2 - space)
b[cn] = ' ';
else
b[cn] = fu;
cout << b[cn];
}
cout << endl;
}
int n2 = (N - 1) / 2;
for (int j = 3; n2 >= j; j += 2)
{
n2 = n2 - j;
h3 += 1;
int space2 = h1 - h3;
for (an = 1; an <= 2 * h1 + 1; an++)
{
if (an <= space2 || an >= 2 * h1 + 2 - space2)
a[an] = ' ';
else
a[an] = fu;
cout << a[an];
}
cout << endl;
}
cout << N - h1 * (2 * h1 + 4) - 1;
}
return 0;
}