2012 浙大机试 Hello World for U

题目1464：Hello World for U

时间限制：1 秒

内存限制：128 兆

特殊判题：否

提交：6883

解决：1908

题目描述：

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

输入：

There are multiple test cases.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.

输出：

For each test case, print the input string in the shape of U as specified in the description.

样例输入：

helloworld!
ac.jobdu.com

样例输出：

h   !
e   d
l   l
lowor
a    m
c    o
.    c
jobdu.

来源：

2012年浙江大学计算机及软件工程研究生机试真题

参考代码

#include <iostream>
#include <string>
using namespace std;

int main()
{
    string str;
    while(cin >> str)
    {
        if(str.length() <= 3)
        {
            cout << str << endl;
            continue;
        }
        int n1, n2, n3;
        int N = str.length();
        n1 = n3 = (N + 2) / 3;
        n2 = N + 2 - n1 - n3;
        int i = 0, j = N - 1;
        while(i < n1 - 1)
        {
            cout << str[i];
            for(int cnt = 0; cnt < n2 - 2; cnt++)
            {
                cout << " ";
            }
            cout << str[j] << endl;
            i++;
            j--;
        }
        for(int cnt = n1 - 1; cnt < n1 + n2 - 1; cnt++)
        {
            cout << str[cnt];
        }
        cout << endl;
    }
    return 0;
}