30人阅读 评论(0)

# 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 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


1. n1<=n2

2. n1=n3

3. 在这个前提下,n1尽可能大(图形要尽可能正方be as squared as possible)

#include<iostream>
#include<string>
using namespace std;
string an;
int main()
{
int len,n1,n2,sp;
cin >> an;
string::iterator ib=an.begin();
string::iterator ie=an.end();
len=an.size();
n1=(len+2)/3;
n2=len+2-2*n1;
sp=n2-2;
for(int i=1;i<=n1;i++)
{
if(i!=n1)
{
cout << *ib;
for(int j=0;j<sp;j++)
cout << ' ';
cout << *(ie-1) << endl;
ib++,ie--;
}
else
{
for(;ib!=ie;ib++)
cout << *ib;
}
}
return 0;
} 

个人资料
等级：
访问量： 4万+
积分： 4427
排名： 8454