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 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 <iostream>
using namespace std;
int main()
{
	string s;
	cin >> s;
	int n = s.size();
	int n1,n2;
	for(n1 = 0;n1 <= n;++ n1)
		if((n + 2 - n1 * 2) < n1)
			break;
	-- n1;
	n2 = n + 2 - n1 * 2;
	for(int i = 0;i < n1 - 1;++ i)
	{
		cout << s[i];
		for(int j = 0;j < n2 - 2;++ j)
			cout << " ";
		cout << s[n - 1 - i];
		cout << endl;
	}
	for(int i = 0;i < n2;++ i)
		cout << s[n1 - 1 + i];
}