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
题目意思:
给定一个字符串,输出其U型形式,要求改U型左右长度小于等于底部长度
思路:
尽可能做到平均分,所以可以直接将字符串长度除3,然后根据余数来判断是否给底边增加长度,因为平均分之后的值就是左右的值了(左右不包括在底边中的那个)。注意如果平均分了之后左右长度+1大于底边长度,不满足题意,就要给左右减2个
代码:(C++)
#include<iostream>
using namespace std;
int main()
{
string str;
cin>>str;
int n = str.size();
int n1 = n / 3;
int n2 = n1;
if(n % 3 == 0)
n1 = n1;
else if(n % 3 == 1)
n2 = n2 + 1;
else if(n % 3 == 2)
n2 = n2 + 2;
if(n1+1 > n2)
{
n1 = n1 - 1;
n2 = n2 + 2;
}
string blank = "";
for(int i=0; i<n2-2; i++)
blank += " ";
for(int i=0; i<n1; i++)
cout<<str[i]<<blank<<str[n-i-1]<<endl;
for(int i=n1; i<n1+n2; i++)
cout<<str[i];
return 0;
}