A1031. Hello World for U (20)

A1031

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 ₁ characters, then left to right along the bottom line with n ₂ characters, and finally bottom-up along the vertical line with n ₃ characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n ₁ = n ₃ = max { k| k <= n ₂ for all 3 <= n ₂ <= N } with n ₁ + n ₂ + n ₃ - 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

我的AC代码如下：

#include <cstdio>
#include <cstring>
int main() {
    int x, y;
    char s[1000];
    int n;
    gets_s(s);
    n = strlen(s);
    int m = (n + 2) % 3;
    if (m != 0) {
        x = (n + 2) / 3 + m;
        y = (n + 2) / 3;
    }
    else {
        x = y = (n + 2) / 3;
    }
    //n2 = x;n1=n3=y;
    y--;
    int count = 0;
    for (int i = 0; i < y; i++) {
        printf("%c", s[count]);
        for (int j = 2; j < x; j++) {
            printf(" ");
        }
        printf("%c", s[n - count - 1]);
        printf("\n");
        count++;
    }
    for (int i = 0; i < x; i++) {
        printf("%c", s[count]);
        count++;
    }
    return 0;
}

注：此题利用找规律的方法做的，很巧妙。