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>
using namespace std;
int main()
{
string s;
cin>>s;
int length = (s.length()+2)/3; //两边纵向高度
int mid = s.length()-2*(length-1)-2; //中间空格数
for(int i=0;i<length-1;i++){
cout<<s[i];
for(int j=0;j<mid;j++)
cout<<" ";
cout<<s[s.length()-i-1]<<endl;
}
for(int i=length-1;i<length+mid+1;i++){
cout<<s[i];
}
return 0;
}
本文探讨如何将任意长度不少于5的字符串,通过特定步骤排列成U形图案,并确保U形尽可能方正。详细介绍了输入输出规范及实现策略。
3263

被折叠的 条评论
为什么被折叠?



