PAT 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​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

• 解题思路
  只用判断出左边和右边的高度，以及底部字符的长度即可

代码实现：

#include <iostream>
#include <string>
using namespace std;
int main()
{
    string st;
    cin >> st;
    int n = st.length();
    int n1, n2, n3;
    if(n % 3 == 0){
        n1 = n/3 -1;
        n2 = n/3 + 2;
        n3 = n1;
    } else {
        n1 = n/3;
        n3 = n1;
        n2 = n-n1-n3;
    }
    for(int i = 0; i < n1; i++)
    {
        int k = n2-2;
        cout << st[i];
        while(k--)
            cout << " ";
        cout << st[n-i-1];
        cout << endl;
    }
    for(int i = n1; i < n1+n2; i++)
        cout << st[i];
    return 0;
}