1031 Hello World for U (20 point(s))

1031 Hello World for U (20 point(s))

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;
char arr[30][30];
int main(void)
{
	string s;cin>>s;
	memset(arr,' ',sizeof(arr));
	int len = s.length();
	int side;
	if(len%3==0)side=len/3-1;
	else side = len/3;
	int mid = len-2*side;
	int count=0;
	for(int i=0;i<side;i++){
		arr[i][0]=s[count++];
	}
	for(int j=0;j<mid;j++){
		arr[side][j]=s[count++];
	}
	for(int i=side-1;i>=0;i--){
		arr[i][mid-1]=s[count++];
	}
	for(int i=0;i<side+1;i++){
		for(int j=0;j<mid;j++){
			cout<<arr[i][j];
		}
		cout<<endl;
	}
	return 0;
}