1031 Hello World for U (20 分)

最新推荐文章于 2021-03-02 09:50:53 发布

原创最新推荐文章于 2021-03-02 09:50:53 发布 · 148 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

C++ 同时被 3 个专栏收录

42 篇文章

订阅专栏

PAT 乙级

36 篇文章

订阅专栏

简单模拟

32 篇文章

订阅专栏

本文解析了一道编程题“1031HelloWorldforU”，题目要求将任意长度大于等于5的字符串按特定U形排列输出。文章详细介绍了输入输出规格，给出了解题思路和示例代码，帮助读者理解并解决此类问题。

1031 Hello World for U (20 分)
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
1
characters, then left to right along the bottom line with n
2
characters, and finally bottom-up along the vertical line with n
3
characters. And more, we would like U to be as squared as possible – that is, it must be satisfied that n
1
=n
3
=max { k | k≤n
2
for all 3≤n
2
≤N } with n
1
+n
2
+n
3
−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<stdio.h>
#include<cstring>
int main(){
	char str[100],ans[40][40];
	scanf("%s",str);/*使用gets时编译器可以运行，但是在提交上出现错误，显示没有此函数；*/ 
	int N=strlen(str);
	int n1=(N+2)/3,n3=n1,n2=N+2-n1-n3;
	for(int i=1;i<=n1;i++){
		for(int j=1;j<=n2;j++){
			ans[i][j]=' ';
		}
	}
	int pos=0;
	for(int i=1;i<=n1;i++){
		ans[i][1]=str[pos++];
	}
	for(int j=2;j<=n2;j++){
		ans[n1][j]=str[pos++];
	}
	for(int i=n3-1;i>=1;i--){
		ans[i][n2]=str[pos++];
	}
	for(int i=1;i<=n1;i++){
		for(int j=1;j<=n2;j++){
			printf("%c",ans[i][j]);
		}
		printf("\n");
	}
	return 0;
}