1031. Hello World for U (20)-PAT

最新推荐文章于 2022-11-29 08:50:46 发布

原创最新推荐文章于 2022-11-29 08:50:46 发布 · 726 阅读

0 ·

CC 4.0 BY-SA版权

ACM/POJ/PAT/九度同时被 2 个专栏收录

130 篇文章

订阅专栏

算法

130 篇文章

订阅专栏

本文介绍了一种将任意长度的字符串以U形排列的方式打印的算法。该算法首先确定最佳的行列分布，确保U形尽可能地接近正方形，并按原始顺序从顶部垂直向下、底部从左向右、再从底部垂直向上输出字符。

1031. Hello World for U (20)

时间限制

400 ms

内存限制

32000 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:

helloworld!

Sample Output:

h   !
e   d
l   l
lowor

推荐指数:※

#include <iostream>
#include <string>
#include <string.h>
using namespace std;
#define  N 81
int main()
{
	int i,j,n,n1,n2,n3;
	char str[N];
	cin.get(str,N);
	n=0;
	while(str[n]!='\0')
		n++;
	n1=(n+2)/3-1;
	n2=n-2*n1;
	for(i=0;i<n1;i++){
		cout<<str[i];
		for(j=0;j<n2-2;j++)
			cout<<" ";
		cout<<str[n-i-1]<<endl;
	}
	for(j=i;j<n-i;j++)
		cout<<str[j];
	return 0;
}