1031 Hello World for U （20 分）

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

分析：图形输出题，意思是输出一个U的形状，不难发现规律，n1=n3=(N+2)/3向下取整，而n2=N+2-n1-n3，代码如下

 /**
 * Copyright(c)
 * All rights reserved.
 * Author : Mered1th
 * Date : 2019-02-23-23.40.16
 * Description : A1031
 */
 #include<cstdio>
 #include<cstring>
 #include<iostream>
 #include<cmath>
 #include<algorithm>
 #include<string>
 #include<unordered_set>
 #include<map>
 #include<vector>
 #include<set>
 using namespace std;

 int main(){
 #ifdef ONLINE_JUDGE
 #else
     freopen("1.txt", "r", stdin);
 #endif
     string str;
     cin>>str;
     int len=str.length();
     int n1,n2,n3;
     n1=(len+)/;
     n3=n1;
     n2=len+-n1-n3;
     int i;
     ;i<n1-;i++){
         printf("%c",str[i]);
         ;j<n2-;j++){
             printf(" ");
         }
         printf(]);
     }
     ;i<n2;i++){
         printf(]);
     }
     ;
 }