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≤n2​​ 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

//我這裡的n1比題目中的n1小了1
//即以下程式碼中n1 + n2 + n3 = N

#include <cstdio>
#include <cstring>
#include <cmath>

int main()
{
	char str[100] = { 0 };
	scanf("%s", str);
	int len = strlen(str);
	int n1 = len / 3;//一般情況
	if(len%3 == 0) n1 -
 
= 1;//為了滿足n1 = n3 = max { k | k≤n2 for all 3≤n≤N } 
	int n2 = len - 2 * n1;
	for (int i = 0; i < n1; i++)
	{
		printf("%c", str[i]);//輸出左半邊
		for (int j = 1; j < n2 - 1; j++) printf(" ");
		printf("%c\n", str[len - i - 1]);//輸出右半邊
	}
	for (int i = n1; i < len - n1; i++) printf("%c", str[i]);//輸出最下一行
	return 0;
}