首页 > 试题广场 >

Hello World for U

[编程题]Hello World for U

热度指数：16760 时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 64M，其他语言128M
算法知识视频讲解

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.

示例1

输入

helloworld!
www.nowcoder.com

输出

h   !
e   d
l   l
lowor
w    m
w    o
w    c
.    .
n    r
owcode

算法知识视频讲解

Python3

chong_0428

def U(s, n):
    n1 = n2  = n // 3
    r = n % 3
    if r == 0:
        n1 -= 1
        n2 -= 1
    n3 = n - 2 * n1
    m1 = s[:n1]
    m3 = s[n1:n3+n1]
    m2 = s[n3+n1:n]
    c = 0
    i = 1
    for _ in range(n1):
        print(m1[c], end='')
        for _ in range(n3-2):
            print(' ', end='')
   
        print(m2[-i])
        i += 1
        c += 1
    print(m3)

    

while True:
    try:
        s = input()
        n = len(s)
        U(s, n)
    except:
        break

发表于 2025-02-25 16:59:15 回复(0)