1031 Hello World for U (20 分)

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

#include<iostream>
#include<cstring>
using namespace std;
int main() {
	string s;
	cin >> s;
	int n=0,m=0;
	for (int i = 1; i <=s.length()/2+1; i++) {
		m = i;
		n = (s.length() + 2 - m) / 2;
		if ((s.length() + 2 - m) % 2 == 1) continue;
		if (m>=n) {
			break;
		}
	}
	for (int i = 0; i <n-1; i++) {
		cout << s[i];
		for (int j = 0; j < m - 2; j++) cout << " ";
		cout << s[s.length() - i-1] << endl;
	}
	for (int k = n - 1; k < n - 1 + m; k++) cout << s[k];
	cout << endl;
	return 0;
}