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 n1characters, 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
题意:给出一个字符串,将该字符串排列成 U 型输出,该 U 型左边和右边相等,即 n1=n3=max { k | k≤n2 for all 3≤n2≤N } ;底部满足 n1+n2+n3−2=N。
AC代码
#include<iostream>
using namespace std;
int main(){
string s;
cin >> s;
int len = s.length();
int n1, n2, minn = 1e5;
for(int i = 1; i <= len+2; i++){
int a;
a = len+2 - 2*i;
if(a-i < 0){
break;
}
if(minn > (a-i)){
minn = a-i;
n1 = i;
n2 = a;
}
}
int i, j, k, m;
for(i=0, k=len-1; i<n1, k>=len-n1; i++, k--){
cout << s[i];
if(i == n1-1){
for(m = n1; m < n1+n2-2; m++){
cout << s[m];
}
}
else{
for(int j = 0; j < n2-2; j++){
cout << " ";
}
}
cout << s[k] << endl;
}
return 0;
}