PAT 1031 Hello World for U python解法

最新推荐文章于 2022-11-12 13:37:40 发布

D_ry

最新推荐文章于 2022-11-12 13:37:40 发布

阅读量309

点赞数

分类专栏： python 用Python刷PAT (Advanced Level) Practice

本文链接：https://blog.csdn.net/qq_36936510/article/details/86309781

版权

该博客介绍了PAT 1031题目的解题过程，涉及将一串字符按照特定的U形布局进行输出。题目要求字符保持原始顺序，从顶部左侧开始向下，然后底部水平向右，最后从底部向上返回，同时U形结构尽可能接近正方形。解题策略是计算满足条件的n1、n2和n3值，并按此规则打印字符串。

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

1031 Hello World for U （20 分）
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₁ characters, then left to right along the bottom line with n₂ characters, and finally bottom-up along the vertical line with n₃ characters. And more, we would like U to be as squared as possible – that is, it must be satisfied that n₁ = n₃ = max { k | k ≤ n₂ for all 3 ≤ n₂ ≤ N} with n₁ + n₂ + n₃ − 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. T