PAT 1031 Hello World for U (20 分) Python

LoveFishO

于 2022-11-12 13:37:40 发布

阅读量212

点赞数

分类专栏： PAT 甲级 Python 文章标签： python

本文链接：https://blog.csdn.net/qq_39415941/article/details/127819242

版权

PAT 甲级 Python 专栏收录该内容

5 篇文章 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 $n_{1}$ characters, then left to right along the bottom line with $n_{2}$ characters, and finally bottom-up along the vertical line with $n_{3}$ characters. And more, we would like Uto be as squared as possible – that is, it must be satisfied that $n_{1}=n_{3}=max\Big(k|k\leqslant n_{2} \space for \space all \space 3 \leqslant n_{2} \leqslant N\Big)$ with $n_{1}+n_{2}+n_{3}-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

代码

letter = input()
letter_num = len(letter)

if letter_num % 3 == 0:

    n1 = n3 = letter_num // 3

else:

    n1 = n3 = letter_num // 3 + 1

n2 = letter_num + 2 - (n1 + n3)

v1 = letter[:n1]
l2 = letter[n1-1: n1 + n2-1]
v3 = letter[n1 + n2 - 2:]

space = len(l2) -2

for i, j in zip(v1[:-1], v3[::-1][:-1]):
    print(i+' ' * space +j)

print(''.join(l2))