1031. Hello World for U

1031. Hello World for U (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>
char a[100][100];
int main()
{
    char str[100];
    gets(str);
    int i = 0, j = 0, n1, n2, n = strlen(str);
    n1 = (n + 2) / 3;
    n2 = n + 2 - 2 * n1;
    for(i = 0; i < n1; i++)
        for(j = 0; j < n2; j++)
        {
            a[i][j] = ' ';
        }
    i = 0;
    for(j = 0; j < n1; j++)
    {
        a[j][0] = str[i++];
    }
    for(j = 1; j < n2; j++)
    {
        a[n1 - 1][j] = str[i++];
    }
    for(j = n1 - 2; j >= 0; j--)
    {
        a[j][n2 - 1] = str[i++];
    }
    for(i = 0; i < n1; i++)
    {
        for(j = 0; j < n2; j++)
        {
            printf("%c", a[i][j]);
        }
        printf("
");
    }
    return 0;
}