PAT_甲级_1031

1031 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
l o w o
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<stdio.h>
#include<string.h>
#include<vector>
#include<string>
using namespace std;
char arr[100];
int main()
{
    cin >> arr;
    int len = strlen(arr);
    int n1_len, n2_len;
    for (n2_len = 3; n2_len <= len; n2_len++) {
        if ((len - n2_len) % 2 == 1) continue;
        n1_len = (len - n2_len + 2) / 2;
        if (n1_len <= n2_len) break;
    }
    for (int i = 0; i < n1_len - 1; i++) {
        cout << arr[i];
        for (int j = 0; j < n2_len - 2; j++) {
            cout << ' ';
        }
        cout << arr[len - 1 - i] << endl;
    }
    for (int i = 0; i < n2_len; i++) {
        cout << arr[n1_len - 1 + i];
    }
    return 0;
}