复习15 Hello World for U

最新推荐文章于 2024-07-23 19:52:44 发布

梦芸.

最新推荐文章于 2024-07-23 19:52:44 发布

阅读量364

点赞数 11

文章标签：算法 c++ 数据结构考研

本文链接：https://blog.csdn.net/qq_53906381/article/details/136165062

版权

这篇文章介绍了如何使用C++编程语言，通过getline函数获取输入字符串，然后按照特定规则将其排列成U形，要求字符顺序不变且保持U形尽可能方正。

摘要由CSDN通过智能技术生成

Hello World for U

描述
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.
输入描述：
There are multiple test cases.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.
输出描述：
For each test case, print the input string in the shape of U as specified in the description.
要点没有字符的部分一定要将空格填充上

#include <bits/stdc++.h>
using namespace std;
int main(){
    string s;
    while(getline(cin,s)){
        int n1,n2,n3;
        n1=n3=(s.size()+2)/3;
        n2=s.size()-2*n1;
        char par[100][100]={0};
        //左列
        int j=0;
        for(int i=0;i<n1;++i){
            par[i][0]=s[j];
            j++;
        }
        //
        for(int i=1;i<=n2;++i){
            par[n1-1][i]=s[j];
            j++;
        }
        //右列
        for(int i=n1-1;i>=0;--i){
            par[i][n2+1]=s[j];
            j++;
        }
        for(int i=0;i<n1-1;++i){
            for(int j=1;j<=n2;++j){
                par[i][j]=' ';
            }
        }
        for(int i=0;i<n1;++i){
            printf("%s\n",par[i]);
        }
    }
}