A1031

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

从N=5开始，模拟几步得到规律：n1=(size+2)/3 n2=size+2-n1*2.

#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<algorithm>
using namespace std;
int main(){
    string str;
    cin>>str;
    int n1=(str.size()+2)/3,n3=n1,n2=str.size()+2-n1-n3;
    for(int i=0;i<n1-1;i++){
        cout<<str[i];
        for(int j=0;j<n2-2;j++){
            cout<<' ';
        }
        cout<<str[str.size()-i-1]<<endl;
    }
    for(int i=0;i<n2;i++)cout<<str[n1+i-1];
    return 0;
}