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，代码如下

 1 /**
 2 * Copyright(c)
 3 * All rights reserved.
 4 * Author : Mered1th
 5 * Date : 2019-02-23-23.40.16
 6 * Description : A1031
 7 */
 8 #include<cstdio>
 9 #include<cstring>
10 #include<iostream>
11 #include<cmath>
12 #include<algorithm>
13 #include<string>
14 #include<unordered_set>
15 #include<map>
16 #include<vector>
17 #include<set>
18 using namespace std;
19 
20 int main(){
21 #ifdef ONLINE_JUDGE
22 #else
23     freopen("1.txt", "r", stdin);
24 #endif
25     string str;
26     cin>>str;
27     int len=str.length();
28     int n1,n2,n3;
29     n1=(len+2)/3;
30     n3=n1;
31     n2=len+2-n1-n3;
32     int i;
33     for(i=0;i<n1-1;i++){
34         printf("%c",str[i]);
35         for(int j=0;j<n2-2;j++){
36             printf(" ");
37         }
38         printf("%c\n",str[len-i-1]);
39     }
40     for(i=0;i<n2;i++){
41         printf("%c",str[n1+i-1]);
42     }
43     return 0;
44 }