PAT A 1031. Hello World for U (20)

最新推荐文章于 2024-05-30 12:54:53 发布

原创最新推荐文章于 2024-05-30 12:54:53 发布 · 474 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT #C++

PAT 专栏收录该内容

99 篇文章

订阅专栏

本文介绍了一种将任意长度的字符串以U形排列的方式打印的算法。该算法旨在使输出尽可能接近正方形形状，首先从左垂直线开始，然后底部水平线，最后是右垂直线上升，同时保持字符的原始顺序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

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 <iostream>
#include <string>
using namespace std;

int main()
{
	string s;
	cin>>s;
	int n1,n2,i,j;
	n2=(s.size()+2)/3+(s.size()+2)%3-2;
	n1=(s.size()+2-n2)/2-1;
	for(i=0;i<n1-1;i++)
	{
		cout<<s[i];
		for(j=0;j<n2;j++)
			cout<<" ";
		cout<<s[s.size()-1-i]<<endl;
	}
	for(i=n1-1;i<n1+n2+1;i++)
		cout<<s[i];

	return 0;
}