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

这一题很简单，就是挺有意思的。首先要确定n1,n2和n3的值。由题可知3*n1 <= N+2,所以n1=(N+2)/3,n2=N+2-2*n1;剩下的就很简单了
#include <stdio.h>
#include <string.h>

#define PRINT_I(x) printf("%s = %d\n",#x,x);
#define PRINT_F(x) printf("%s = %f\n",#x,x);
#define PRINT_S(x) printf("%s = %s\n",#x,x);

int main(int argc,char* argv[])
{
	int i,j,k,length,n1,n2;
	char s[80];

	scanf("%s",s);
	length = strlen(s);

	n1 = (length+2) / 3;
	n2 = length + 2 - 2*n1;
	
	for(i=0,j=length-1;i<n1-1;i++,j--)
	{
		printf("%c",s[i]);
		for(k=0;k<n2-2;k++)
			printf(" ");
		printf("%c",s[j]);
		printf("\n");
	}
	for(i=n1-1;i<n1+n2-1;i++)
		printf("%c",s[i]);
	printf("\n");

	return 0;
}