1031 Hello World for U (20point(s))

1031 Hello World for U (20point(s))
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 n1
​​ 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 n1+n2+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 <string>
using namespace std;

int main()
{
    string str;
    cin>>str;
    int n1,n2,n3,N;
    N = str.length()+2;  //n1+n2+n3 = N 
    if(N%3==0)
    {
        n3 = n2 = n1 = N/3;
    }
    else
    {
        n3 = n1 = N/3;
        n2 = N/3 + N%3;
    }

    int i,j;
    i = 0;
    j = N-2-1;
    for(;i<n1-1 && j>0;i++,j--)
    {
        cout<<str[i];
        for(int k = 0;k<n2-2;k++)
        {
            cout<<' ';
        }
        cout<<str[j]<<endl;
    }
    for(int k = n1-1;k<N-n1-1;k++)
    {
        cout<<str[k];
    }
    cout<<endl;
  

    return 0;
}