PAT 甲级 1031 Hello World for U（20 分）

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​1​​ characters, then left to right along the bottom line with n​2​​ characters, and finally bottom-up along the vertical line with n​3​​ characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n​1​​=n​3​​=max { k | k≤n​2​​ for all 3≤n​2​​≤N } with n​1​​+n​2​​+n​3​​−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

# include <iostream>
# include <string>
using namespace std;

int main(){
//	freopen("C:\\1.txt", "r", stdin);
	string s;
	cin >> s;
	int len = s.length();
	int edge = (len + 2) / 3;
	for(int i = 0; i < len; i++){
		if(i < edge -1){
			printf("%c", s[i]);
			for(int j = 0; j < len - 2*edge; j++)
				printf(" ");
			printf("%c\n", s[len - i -1]);
		}
		else if(i >= edge-1){
			for(int j = i; j < len - edge +1; j++){
				printf("%c", s[j]);
			}
			break;
		}
	}
}