1031 Hello World for U(20)

最新推荐文章于 2020-02-09 00:20:18 发布

Fcity_sh

最新推荐文章于 2020-02-09 00:20:18 发布

阅读量184

点赞数

分类专栏：算法文章标签：甲级 pat Hello World for U

本文链接：https://blog.csdn.net/fcity_sh/article/details/83892101

版权

算法专栏收录该内容

52 篇文章 0 订阅

订阅专栏

本文介绍了一种将任意长度的字符串转换为U形排列的算法，重点在于确定U形的三个部分（左侧、底部、右侧）的字符数量，使整体形状尽可能接近正方形。通过输入一个不包含空格的字符串，算法会将其按特定顺序重新排列，并输出成U形布局。

摘要由CSDN通过智能技术生成

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 n1 characters, then left to right along the bottom line with n2 characters, and finally bottom-up along the vertical line with n3 characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n1=n3=max { k | k≤n2 for all 3≤n2≤N } with n1+n2+n3−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

思路：这道题最主要的就是n1,n2,n3的求值，要让它们的值最接近。

#include<iostream>
#include<string>
using namespace std;
int main()
{
	string str;
	cin>>str;
	int len=str.length();
	int n1=(len+2)/3;
	int n2=len-2*n1+2;
	for(int i=0;i<n1-1;i++)
	{
		for(int j=0;j<n2;j++)
		{
			if(j==0)
			cout<<str[i];
			else if(j==n2-1)
			cout<<str[len-i-1];
			else
			cout<<" ";
		}
		cout<<endl;
	 } 
	 for(int i=1;i<=n2;i++)
	 {
	 	cout<<str[n1+i-2];
	 }
 }