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

解题思路：
计算n1,n2,n3，按照“首+（n-2）空格+尾+\n”，输出n-1行，再把剩下来的在一行中输出。所以关键就是求n1,n2,n3。

#include<cstdio>
#include<cstring>
int main(){
    int n1,n2,n3;
    char str[90];
    scanf("%s",str);
    int len=strlen(str);
    n1=n3=(len+2)/3;
    //n2=n1+(len+2)%3;  
    n2=len-n1-n3+2;     //n为字符串长度+2 
    int st=0,ed=len-1;
    for(int i=0;i<n1-1;i++){
        printf("%c",str[st++]);
        for(int j=0;j<n2-2;j++){
            printf(" ");
        }
        printf("%c\n",str[ed--]);
    }
    for(int i=0;i<n2;i++){
        printf("%c",str[st++]);
    }   
    return 0;
}