PAT (Advanced Level) Practise 1031 Hello World for U (20)

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

题意：将给你的字符串按U字型输出

#include <iostream>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstring>

using namespace std;

int main()
{
    char ch[100];
    while(~scanf("%s",ch))
    {
        int len=strlen(ch);
        if((len+2)%3==0)
        {
            int l=0,r=len-1;
            int h=(len+2)/3-1;
            for(int i=0;i<h;i++)
            {
                printf("%c",ch[l++]);
                for(int j=0;j<h-1;j++)
                    printf(" ");
                printf("%c\n",ch[r--]);
            }
            while(l<=r)
                printf("%c",ch[l++]);
        }
        else if((len+2)%3==1)
        {
            int l=0,r=len-1;
            int h=(len+2)/3-1;
            for(int i=0;i<h;i++)
            {
                printf("%c",ch[l++]);
                for(int j=0;j<=h-1;j++)
                    printf(" ");
                printf("%c\n",ch[r--]);
            }
            while(l<=r)
                printf("%c",ch[l++]);
        }
        else
        {
            int l=0,r=len-1;
            int h=(len+2)/3-1;
            for(int i=0;i<h;i++)
            {
                printf("%c",ch[l++]);
                for(int j=0;j<=h;j++)
                    printf(" ");
                printf("%c\n",ch[r--]);
            }
            while(l<=r)
                printf("%c",ch[l++]);
        }
        printf("\n");
    }
    return 0;
}