九度OJ-题目1464：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
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   dl   llowora    mc    o.    c
jobdu.

代码如下（c++）：

using namespace std;#include <iostream>#include <string>#include <assert.h>int main(){string str;while (cin >> str){int numOfStr = str.length();assert(numOfStr >= 5 && numOfStr<80);int numOfLeft = (numOfStr + 2) / 3 - 1;int numOfRight = numOfLeft;int numOfButtom = numOfStr - numOfLeft - numOfRight;string strLeft = str.substr(0, numOfLeft);string strBottom = str.substr(numOfLeft, numOfButtom);string strRight = str.substr(numOfLeft + numOfButtom, numOfRight);//reverse(strRight.begin(), strRight.end());for (int i = 0; i < numOfLeft; i++){cout << strLeft[i];for (int j = 0; j < numOfButtom - 2; j++)cout << " ";cout << strRight[numOfRight - i - 1];cout << endl;}cout << strBottom << endl;}}