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 <iostream>
#include <string>
using namespace std;
int main()
{
string ss;
while(cin>>ss)
{
int x,y;
bool u=false;
for(x=ss.length();x>=;x--)
{
if(x<)
{
for(y=;y<=ss.length();y++)
if(*x+y-==ss.length())
{
u=true;
break;
}
}
else
{
for(y=x;y<=ss.length();y++)
if(*x+y-==ss.length())
{
u=true;
break;
}
}
if(u) break;
}
int i=;int j=ss.length()-;int k;
int tem=x-;
while(tem--)
{
cout<<ss[i++];
for(k=;k<y-;k++) cout<<" ";
cout<<ss[j--];
cout<<endl;
}
for(k=i;k<=j;k++)
cout<<ss[k];
cout<<endl;
}
return ;
}