浙大2012上机 PAT 1031. Hello World for U (20)

最新推荐文章于 2022-03-02 14:16:39 发布

原创最新推荐文章于 2022-03-02 14:16:39 发布 · 745 阅读

0 ·

CC 4.0 BY-SA版权

ACM 同时被 2 个专栏收录

70 篇文章

订阅专栏

PAT

16 篇文章

订阅专栏

本文介绍了一种将任意长度字符序列以尽可能接近正方形的U形布局进行打印的方法。通过计算确定最佳的垂直和底部行长度，使得字符按原始顺序排列成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

注意考虑字符串长度仅为5的情况。

代码如下：

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstring>
int main()
{
#ifdef ONLINE_JUDGE
#else
	freopen("D:\\in.txt","r",stdin);
	freopen("D:\\out.txt","w",stdout);
#endif
    char str[1000];
	scanf("%s",str);
	int len=strlen(str);
	int maxt=0;
	//for(int i=3;i<=len/2;i++)
	//当字符串长度为5时，则排版不正确
	for(int i=3;i<=len;i++)
	{
	   int t=(len-i)/2;
	   if(t>maxt&&t<i)
	   {
		   maxt=t;
	   }
	}
	int max2=len-maxt*2;
	for(int i=0;i<maxt;i++)
	{
		printf("%c",str[i]);
		for(int j=0;j<max2-2;j++)
			printf(" ");
		printf("%c\n",str[len-i-1]);
	}
	for(int i=maxt;i<maxt+max2;i++)
		printf("%c",str[i]);
	return 0;
}