【PAT刷题甲级】1031.Hello World for U

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 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，需要满足：
n1 = n3 = max { k | k ≤ n2 for all 3 ≤ n2 ≤ N }
n1 + n2 + n3 - 2 = N

代码

#include <iostream>
using namespace std;
int main() {
	int n1,n2,n3,max=0;
	string s;
	cin >> s;
	int N = s.length();
	for(n2=3; n2<=N; n2++) {
		if((N-n2)%2==0) {
			n1 = (N-n2)/2 + 1;
			if(n1 <= n2 && n1>max) {
				max = n1;
			}
		}
	}
	n2 = (N - 2 * max) + 2;
	n1 = n3 = max;
	for(int i=0; i<n1; i++) {
		if(i!=n1-1) {
			cout << s[i];
			for(int j=0; j<n2-2; j++) 
				cout << " ";
			cout << s[N-1-i] << endl;
		} else {
			for(int k=0; k<n2; k++) 
				cout << s[i+k];
		}
	}
	return 0;
}