KY147 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.

输入描述：

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.

代码

int main()
{
    char str1[100];
    int res_weight = 0;
    int n1 = 0, n2;
    scanf("%s", str1);
    int count = strlen(str1);
    for (n2 = 3; n2 < count; n2++)
    {
        if ((count + 2 - n2) % 2 == 0 && n1 <= (count + 2 - n2) / 2 && n2 >= (count + 2 - n2) / 2)
        {
            res_weight = n2;
            n1 = (count + 2 - n2) / 2;
        }
    }
    char result[30][30];
    for (int i = 0; i < 30; i++)
    {
        for (int j = 0; j < 30; j++)
        {
            result[i][j] = ' ';
        }
    }
    int tag = 0;
    for (int i = 0; i < n1; i++)
    {
        result[i][0] = str1[tag++];
    }
    for (int i = 1; i < res_weight; i++)
    {
        result[n1 - 1][i] = str1[tag++];
    }
    for (int i = n1 - 2; i > -1; i--)
    {
        result[i][res_weight - 1] = str1[tag++];
    }
    for (int i = 0; i < 30; i++)
    {
        for (int j = 0; j < 30; j++)
        {
            printf("%c", result[i][j]);
            // printf(const char *restrict format, ...)
        }
        printf("\n");
    }
    return 0;
}