【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

解题思路：

主要还是看懂下面这一句话

 我的理解是，先看with后面的那句，n1+n2+n3-2=N;这句就是在告诉我们，n2=N+2-2n1。然后再看前面那个max的那句。那句其实就是让n1=n3取到最大值，也就是说可以理解成 n1=n3=k；但是k=n2，而n2要满足大于等于3小于等于N。因为N5，所以n1 = n3 = k3。

由上面的信息我们就可以得出: 

{

        n2 = N + 2 - 2n1;

       n1 = k n2N;

}

所以推出 ：

n1 = （N+2）/3；

n2 = N+2-2n1；

n1就是U的行数，N2就是U的列数，得出行列数后，输出U就很简单啦。

代码：

#include<bits/stdc++.h>
using namespace std;
int main(){
	string a;
	cin>>a;
	int i=0,j=a.size()-1;
	int n1,n2;
	n1 = (j+3)/3;
	n2 = j+3-2*n1;
	for(int x=0;x<n1;x++){
		if(x!=n1-1){
			cout<<a[i];
			for(int y=0;y<n2-2;y++) cout<<" ";
			cout<<a[j]<<endl;
			i++;j--;
		}
		else{
			while(i<=j){
				cout<<a[i];
				i++;
			}
		}
	}
 	return 0;
}