PAT A1031. Hello World for U (20)

最新推荐文章于 2023-01-15 13:04:54 发布

原创最新推荐文章于 2023-01-15 13:04:54 发布 · 260 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#图形输出

PAT 专栏收录该内容

125 篇文章

订阅专栏

本文介绍了一种将任意长度大于等于5的字符串打印成U形的方法，并通过具体示例进行说明。该算法确保字符按原始顺序排列，从左垂直线顶部开始向下打印，然后沿底部水平线从左向右打印，最后沿右垂直线从下向上打印。

Given any string of N (>=5) characters, you are asked to form the characters into the shape of U. For example, "helloworld" can be printed as:

h  d
e  l
l  r
lowo

That is, the characters must be printed in the original order, starting top-down from the left vertical line with n₁characters, then left to right along the bottom line with n₂ characters, and finally bottom-up along the vertical line with n₃ characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n₁ = n₃ = max { k| k <= n₂ for all 3 <= n₂ <= N } with n₁ + n₂ + n₃ - 2 = N.

Input Specification:

Each input file contains one test case. Each case contains one string with no less than 5 and no more than 80 characters in a line. The string contains no white space.

Output Specification:

For each test case, print the input string in the shape of U as specified in the description.

Sample Input:

helloworld!

Sample Output:

h   !
e   d
l   l
lowor

#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#define Max 110
using namespace std;
int main()
{
	char s[Max]={};
	int sum=0,x,y,z,f=0;
	gets(s);
	sum=strlen(s);
	x=y=(sum+2)/3;
	z=sum+2-2*x;
	char ss[Max][Max];
	for(int i=0;i<Max;i++)
		for(int j=0;j<Max;j++) ss[i][j]=' ';
	for(int i=0;i<x;i++) ss[i][0]=s[f++];
	for(int i=1;i<z;i++) ss[x-1][i]=s[f++];
	for(int i=x-2;i>=0;i--) ss[i][z-1]=s[f++];
	for(int i=0;i<x;i++)
	{
		for(int j=0;j<z;j++)
		{
			
				printf("%c",ss[i][j]);
		
			 
		}
		printf("\n");
	}
	system("pause");
	return 0;
}