PAT A1031. Hello World for U

1031. Hello World for U (20)

时间限制

400 ms

内存限制

65536 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 <stdio.h>
#include <string.h>


int main() {
	char str[90];
	int length, n1, n3, n2, i, j;
	scanf("%s", str);
	length = strlen(str);
	n1 = n3 = (length + 2) / 3;
	n2 = length + 2 - 2 * n1;
	for(i = 0; i < n1 - 1; i ++) {
		printf("%c", str[i]);
		for(j = 0; j < n2 - 2; j ++) {
			printf(" ");
		}
		printf("%c\n", str[length - 1 - i]);
	}
	for(; i <= n1 + n2 - 2; i ++) {
		printf("%c", str[i]);
	}
	return 0;
}