1031 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.

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

坑点测试1

aaaaaaa

输出样例1


a a
a a
aaa

坑点测试2

aaaaaaaaa

输出样例2


a   a
a   a
aaaaa

考察 : 信息判断

注意 : 边界输入

思路 : n1 = (s.size()-1)/3

C/C++


#include
using namespace std;
int main()
{
    string s;
    int n1,n2;
    
    cin >> s;
    n1 = (s.size()-1)/3;
    n2 = s.size() - n1 - n1;
    
    for(int z=0;z
        cout << s[z];
        for(int z1=2;z1" ";
        cout << s[s.size()-z-1] << endl;
    }
    for(int z=0;z
    return 0;
}

相关阅读:
每个 .vue 文件最多可以包含一个顶层＜template＞块
NR 物理层卷积|狄拉克函数 2- 狄拉克函数和傅里叶变换
集成Swagger
GEE：求最大值的几种方法
计算机毕业设计ssm飞机售票管理系统63z52系统+程序+源码+lw+远程部署
快速掌握kafka原理以及常见面试题
【C++ Efficiency】使用运算符的复合形式取代其单独形式，效率更高
【2023年11月第四版教材】第17章《干系人管理》（第一部分）
什么？你还不知道ERD Online要干什么
【升职加薪秘籍】我在服务监控方面的实践(2)-监控组件配置

原文地址：https://blog.csdn.net/daybreak_alonely/article/details/126346210