PAT (Advanced Level) Practice 1031 Hello World for U （20 分）

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

 求2n1+n2=N+2等式n1的最大值(n1<=n2)，只有当n1==n2的时候n1取最大，然后用长度减去2*n1即可求出n2。

代码如下:

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
char a[100][100];
char s[100];
int len;
int main()
{
    scanf("%s",s);
    len=strlen(s);
    int n1,n2;
    n1=(len+2)/3;
    n2=len-2*(n1-1);
    for (int i=0;i<n1;i++)
        for (int j=0;j<n2;j++)
            a[i][j]=' ';
    int num=0;
    for (int i=0;i<n1-1;i++)
        a[i][0]=s[num++];
    for (int i=0;i<n2;i++)
        a[n1-1][i]=s[num++];
    for (int i=n1-2;i>=0;i--)
        a[i][n2-1]=s[num++];
    for (int i=0;i<n1;i++)
    {
        for (int j=0;j<n2;j++)
            printf("%c",a[i][j]);
        printf("\n");
    }
    return 0;
}