1031 Hello World for U (20 分)

Shine_YP

已于 2022-02-24 09:09:38 修改

阅读量337

点赞数

分类专栏： PAT甲级C++题解文章标签： C++ 字符串处理格式输出算法实现 U形布局

于 2022-02-24 09:08:07 首次发布

本文链接：https://blog.csdn.net/m0_48118006/article/details/123103963

版权

PAT甲级C++题解专栏收录该内容

28 篇文章 0 订阅

订阅专栏

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

Sample Solution：

#include <bits/stdc++.h>
using namespace std;

//计算题
int main(){
    string s;
    int len,gap,line;
    cin>>s;
    len=s.length();
    gap=(len+2)/3+(len+2)%3-2;
    line=(len+2)/3-1;
    int i;
    for(i=0;i<line;i++){
        cout<<s[i];
        for(int j=0;j<gap;j++)cout<<' ';
        cout<<s[len-1-i]<<endl;
    }
    for(int j=i;j<len-i;j++)cout<<s[j];
    return 0;
}