[PAT A1031] 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.

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为左侧竖线字符数，n2为底部横线字符数，n3为右侧竖线字符数，易得限制条件为n1==n3，n2>=n1,并使n1尽可能大，则穷举所有符合条件的n1和n2取值情况，并保存其中n1的最大取值，进而求出对应n2和n3，就也不难得出对应图形。

代码如下：

#include <cstdio>
#include <cstring>

int main(){
    int i,j,k = -1,len,n1 = 0,n2 = 0;
    char str[85];
    scanf("%s",str);
    len = strlen(str);
    for(n2 = len;n2>=3;n2--){
        n1 = (len+2-n2)/2;
        if(n1 > k && n1 <= n2) k = n1;
    }
    n1 = k ;
    n2 = len+2-2*k;
    //printf("%d %d %d %d\n",len,n1,k,n2);
    for(i = 0;i < n1-1;i++){
        printf("%c",str[i]);
        for(j = 0;j < n2 - 2;j++) printf(" ");
        printf("%c\n", str[len-1-i]);
    }
    for(j = 0;j < n2;j++){
        printf("%c",str[i++]);
    }
    return 0;
}