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
1characters, 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.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main ()
{
char str[90];
scanf("%s",str);
int length=strlen(str),i,left,below,j;
for( i=(length+2)/3;i>=2;i--)
{
below=length+2-2*i;
if(i<=below) break;
}
left=i-1;
for( i=0;i<left;i++)
{
printf("%c",str[i]);
for( j=0;j<below-2;j++) printf(" ");
printf("%c\n",str[length-1-i]);
}
for( i=0;i<below;i++) printf("%c",str[left+i]);
printf("\n");
system("pause");
return 0;
}
