PAT甲级-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
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.

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

题目意思大概是输入一个字符串，然后输出成U型，左边一列时n1个，底下时n2个，右边一列是n3个。他们满足:①n1n3小于等于n2 ②n1=n3 ③n1+n2+n3-2=N(字符总数)
解题思路:这道题我们首先得确定n1n2n3的值才会比较好做，有了上面三个条件可以推导出公式，如果不会推导也可以写几个数找规律，得出结论n2=(N+2)/3，然后n1=n3=(N-n2)/2。按格式输出即可。

#include<iostream>
using namespace std;

int main()
{
	string s;
	cin>>s;
	int n1,n2;
	int L=s.size();
	n1=(L+2)/3;
	n2=(L+2)-2*n1;
	for(int i=0;i<n1-1;i++) {
		cout<<s[i];
		for(int j=0;j<n2-2;j++) cout<<" ";
		cout<<s[L-i-1]<<endl;
	}
	for(int i=n1-1;i<L-n1+1;i++) {
		cout<<s[i];
	}
}