A1031. Hello World for U (20)

最新推荐文章于 2023-05-04 23:30:57 发布

cobread

最新推荐文章于 2023-05-04 23:30:57 发布

阅读量136

点赞数

分类专栏： PAT

本文链接：https://blog.youkuaiyun.com/daijie_whu/article/details/79378067

版权

PAT 专栏收录该内容

34 篇文章

订阅专栏

本文介绍了一种将任意长度（大于等于5）的字符串按U形打印的方法，并提供了一个参考实现代码。该算法确保字符按原始顺序排列，从左垂直线开始向下打印，接着沿底部水平线从左向右打印，最后沿右垂直线向上打印，力求使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<cstdio>
#include<cstring>
int main(){
	char str[81];
	scanf("%s",str);
	int len=strlen(str);
	int lr=(len+2)/3,bot;
	bot=lr+(len+2)%3;
	for(int i=0;i<lr-1;i++){
		printf("%c",str[i]);
		for(int j=0;j<bot-2;j++){
			printf(" ");
		}
		printf("%c\n",str[len-1-i]);
	}
	for(int i=0;i<bot;i++){
		printf("%c",str[lr+i-1]);
	}
	printf("\n");
	return 0;
}