1031 Hello World for U -PAT甲级

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<bits/stdc++.h>
using namespace std;
int main(){
	string s;
	cin>>s;
	int n1=ceil(s.size()*1.0/3),n2;
	while(true){
		n2=s.size()-2*n1+2;
		if(n1<=n2)
			break;
		n1--;
	}
	int i,j;
	for(i=0,j=s.size()-1;i<n1-1;i++,j--){
		printf("%c",s[i]);
		for(int j=0;j<n2-2;j++){
			printf(" ");
		}
		printf("%c\n",s[j]);
	}
	for(int k=0;k<n2;k++){
		printf("%c",s[k+i]);
	}
	return 0;
}