- 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 n1 characters, then left to right along the bottom line with n2 characters, and finally bottom-up along the vertical line with n3 characters. And more, we would like U to be as squared as possible – that is, it must be satisfied that n1 = n3 = max { k| k <= n2 for all 3 <= n2 <= N } with n1 + n2 + n3 - 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 n, m;
char ma[1231];
int main()
{
scanf("%s", ma);
int len = strlen(ma);
int maxn = -1;
for(int i=3;i<=len;i++)
{
for(int j=1;j<=i;j++)
{
if(2*j+i==len+2)
{
if(j>maxn)
maxn = j;
continue;
}
}
}
int b = len + 2 - 2 * maxn;
for(int i=0;i<maxn-1;i++)
{
printf("%c", ma[i]);
for(int j = 0 ;j<b-2;j++)
printf(" ");
printf("%c", ma[len-i-1]);
printf("\n");
}
for(int j=maxn-1;j<=len-maxn;j++)
printf("%c", ma[j]);
printf("\n");
return 0;
}