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 lowoThat 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.
Sample Input:helloworld!Sample Output:
h ! e d l l lowor
#include<iostream>
#include<cstdio>
using namespace std;
#include<cstring>
int caln2(int n)
{
return (n+2)%3+(n+2)/3;
}
int caln1n3(int n)
{
return ((n+2)-caln2(n))/2;
}
char s[10001];
int main()
{
cin>>s;
int len=strlen(s);
int n2=caln2(len);
int n=caln1n3(len);
int cnt=0;
for(int i=1;i<n;i++)
{
for(int j=1;j<=n2;j++)
{
if(j==1)
{
cout<<s[i-1];
}
else if(j==n2)
{
cout<<s[len-i];
}
else cout<<" ";
}
cout<<endl;
}
for(int i=1;i<=n2;i++)
{
cout<<s[n-2+i];
}
cout<<endl;
return 0;
}