1031. Hello World for U (20)

最新推荐文章于 2024-05-14 10:22:53 发布

原创最新推荐文章于 2024-05-14 10:22:53 发布 · 139 阅读

0 ·

CC 4.0 BY-SA版权

PAT习题专栏收录该内容

50 篇文章

订阅专栏

本文介绍了一种将任意长度（大于等于5）的字符串按U形格式打印的算法实现。该算法通过C++编程语言完成，并确保输出尽可能接近正方形形状，同时保持字符的原始顺序。文章提供了一个具体示例，展示如何将helloworld!这个字符串转换成所需的U形格式。

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

#include<iostream>
#include<fstream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#define inf 1000000
using namespace std;

int main()
{
	//ifstream fin("Text.txt");
	string str;
	cin >> str;
	int N = str.size();
	int n1, n2, n3;
	int max = 0;
	for (n2 = 3; n2 <= N; n2++)
	{
		n1 = (N + 2 - n2)/2;
		if (n1 > max&&n1<=n2)
			max = n1;
	}
	n1 =n3= max;
	n2 = N + 2 - 2 * max;
	int i, j, l;
	l = N - 1;
	string sp(n2-2,' ');
	
	for (i = 0; i < n1 - 1; i++)
		cout << str[i]<<sp<<str[l-i]<<endl;
	for (i = 0; i < n2; i++)
		cout << str[n1 - 1 + i];

		
	

	
	
	return 0;
}

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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: