HelloWorldForU

题目描述：
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 n1 characters, then left to right along the bottom line with n2 characters, and finally bottom-up along the vertical line with n3 characters. And more, we would like U to be as squared as possible – that is, it must be satisfied that n1 = n3 = max { k| k <= n2 for all 3 <= n2 <= N } with n1 + n2 + n3 - 2 = N.
输入：
There are multiple test cases.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.
输出：
For each test case, print the input string in the shape of U as specified in the description.
样例输入：

helloworld!

样例输出：

h   !
e   d
l   l
lowor

#include<cstdio>
#include<cstring>
using namespace std;

int main(){
    char str[100];
    gets(str);
    int N = strlen(str);
    int n1 = (N + 2) / 3, n3 = n1,n2 = N + 2 - n1 - n3;
    for (int i = 0; i < n1 - 1; i++){//数字从零开始，所以左边一列是0到n1-1，此处输出的是除了最后一行的U
        printf("%c", str[i]);
        for (int j = 0; j < n2 - 2; j++){
            printf(" ");
        }
        printf("%c\n", str[N - i - 1]);
    }
    for (int i = n1 - 1; i <= n2 + n1 - 2; i++){
        printf("%c", str[i]);
  }//下面一行从n1-1开始，一共n2个，到n2+n1-1-1结束  (就是 尾-头=数字个数-1)
    return 0;
}