1031. 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  de  ll  rlowo

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 <cstdio>

#include <cstdlib>

#include<iostream>

using namespace std;

#include <deque>

#include <queue>

#include <string>

#include <vector>

#include <iomanip>

#include<algorithm>

using namespace std;

int main()

{

   string s;

   cin>>s;

   int n=s.length();

   int n1=(n+2)/3-1;

   int n2=(n+2)/3;

   int h=(n+2)%3;

   if(h==1)n2++;

   if(h==2)n2+=2;

   int i,j;

   for(i=0;i<n1;i++)

   {

       cout<<s[i];

       for(j=0;j<n2-2;j++)

        cout<<' ';

    cout<<s[n-i-1]<<endl;

   }

   for(j=i;j<i+n2;j++)

    cout<<s[j];

   return 0;

}