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 2 = max ⁡ { k ∣ k &lt; = n 2 , 3 ≤ n 2 ≤ N } n_1 =n_2=\max\{k|k&lt;=n_2,3\le n_2\le N\} n1​=n2​=max{k∣k<=n2​,3≤n2​≤N} with $n_1+n_2+n_3=N+2$

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 <vector>
#include <string>

using namespace std;

int main(void)
{
    string str;
    cin >> str;
    auto N = str.size();

    decltype(N) n1,n2,n3;

    if(N==5){
        n1 = n3 = 2;
        n2 = 3;
    }else if(N==6){
        n1 = n3 = 2;
        n2 = 4;
    }else{
        n2 = (N+2)/3;
        if(3*n2-2<N) n2++;
        n1 = n3 = (N+2-n2)/2;

        if(n1+n2+n3<N+2) n2++;
    }

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

    cout<<endl;
    return 0;
}