PAT-A1031 Hello World for 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

底部字符数量 n2 最少为3。n1 = n3 要尽量等于 n2 。也就是说，n1 = n3 = （n+2） / 3；因为 '/ 3' 会截掉小数部分，所以 n1 和 n3 总是小于或者等于 n2 。

#include <stdio.h>
#include <string.h>
 
int main()
{
	char sentence[81];
	int n1, len,i,j,space;
	scanf("%s", sentence);
	len = strlen(sentence);
	n1 = (len + 2) / 3; // n1 和 n3 相同
	for (i = 0,j=len-1; i < n1-1; i++,j--) {
		printf("%c", sentence[i]);
		for (space = 0; space < len - 2 * n1; space++)
			printf(" ");
		printf("%c\n", sentence[j]);
	}
    //输出最后一行
	while (i != j+1)
		printf("%c",sentence[i++]);
	return 0;
}