PAT 甲级 1031 Hello World for U（20 分）

最新推荐文章于 2021-04-14 20:48:57 发布

原创最新推荐文章于 2021-04-14 20:48:57 发布 · 201 阅读

0 ·

CC 4.0 BY-SA版权

PAT 甲级专栏收录该内容

41 篇文章

订阅专栏

本文介绍了一道编程题目，要求将输入的字符串以特定的U形方式进行打印。具体而言，字符串需要按照从左垂直边开始，向下打印n1个字符，接着从底部水平边由左向右打印n2个字符，并最后沿右侧垂直边上行打印n3个字符。题目还要求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 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

# include <iostream>
# include <string>
using namespace std;

int main(){
//	freopen("C:\\1.txt", "r", stdin);
	string s;
	cin >> s;
	int len = s.length();
	int edge = (len + 2) / 3;
	for(int i = 0; i < len; i++){
		if(i < edge -1){
			printf("%c", s[i]);
			for(int j = 0; j < len - 2*edge; j++)
				printf(" ");
			printf("%c\n", s[len - i -1]);
		}
		else if(i >= edge-1){
			for(int j = i; j < len - edge +1; j++){
				printf("%c", s[j]);
			}
			break;
		}
	}
}