浙江大学PAT_甲级_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 ₁  characters, then left to right along the bottom line with n ₂  characters, and finally bottom-up along the vertical line with n ₃  characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n ₁  = n ₃  = max { k| k <= n ₂  for all 3 <= n ₂  <= N } with n ₁  + n ₂  + n ₃  - 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

我的C++程序：

#include <iostream>  
#include <string>  
using namespace std;
int main()
{
	int height,width;//height=高度，width=宽度，width>=3
	string s;//字符个数>=5
	cin >> s;
	width = (s.size() % 2 !=0) ? 3 : 4;//奇数个字符，u底部宽度从3开始递增，公差为2。
	while (width<= s.size())
	{
		height = (s.size()+2 - width) / 2;//根据2*高度+宽度-2=字符个数得
		if (height<=width)//宽度应该大于高度
			break;
		width+= 2;
	}
	int i = 0;
	for (; i < height - 1; i++)
	{
		cout << s[i];//首字符
		for (int j = 0; j < width - 2; j++)//中间空格
		{
			cout << " ";
		}
		cout << s[s.size() - i - 1] << endl;//尾字符
	}
	for (int j = i; j < s.size() - i; j++)//输出最底层
	{
		cout << s[j];
	}
	//system("pause");
	return 0;
}