Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1031. Hello World for U

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 <cstdio>
#include <cstring>

int main()
{
	char s[100]; scanf("%s", s);
	int n = strlen(s), n1 = (n + 2) / 3, n2 = n + 2 - 2 * n1;
	for (int i = 0; i < n1 - 1 ; i++)
	{
		printf("%c", s[i]);
		for (int j = 2; j < n2; j++) putchar(' ');
		printf("%c\n", s[n-1-i]);
	}
	for (int i = n1 - 1; i < n1 + n2 - 1; i++)
		printf("%c", s[i]);
	printf("\n");
	return 0;
}
上一篇: 下一篇:

我的博客

NoAlGo头像编程这件小事牵扯到太多的知识,很容易知其然而不知其所以然,但真正了不起的程序员对自己程序的每一个字节都了如指掌,要立足基础理论,努力提升自我的专业修养。

站内搜索

最新评论