算法笔记3.3B：Hello World for U

题目描述

---

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.

---

输入

---

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.

---

输出

---

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<stdio.h>
#include<string.h>

const int maxN = 90;

int main(){
    char U[maxN];       //存储生成图形使用的字符串
    int n1, n2, n3;     //U图形的左边字符数n1,U图形的底边字符数n2,U图形的右边字符数n3
    int N;              //字符串字符数
    while(scanf("%s", U) != EOF){
        N = strlen(U);
        n1 = n3 = ( N + 2 ) / 3;    //依题意n2>= n1 = n3,根据公式得n2等于或略大于n1、n3
        n2 = N + 2 - n1 - n3;
        for(int i = 0 ; i < n1 - 1; i++){
            printf("%c", U[i]);
            for(int j = 0; j < n2 - 2; j++)
                printf(" ");
            printf("%c\n", U[N - i -1]);
        }
        for(int k = n1 - 1; k <= n1 + n2 -2; k++)
                printf("%c", U[k]);
        printf("\n");
    }
    return 0;
}

---

总结：解题主要在于确认n1、n2、n3的值，主要分析公式的对应关系。
生僻词：bottom底部