KY147 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.
示例1

输入：
helloworld!
www.nowcoder.com
输出：
h   !
e   d
l   l
lowor
w    m
w    o
w    c
.    .
n    r
owcode

题目大意：
给定任意一个N(>=5)个字符的字符串，要求您将这些字符形成u的形状。例如，“helloworld”可以打印为:h de ll r low。也就是说，这些字符必须按照原始顺序打印，从左到右从下至上的竖线打印n1个字符，然后从左到右沿底线打印n2个字符，最后从下至上的竖线打印n3个字符。更重要的是，我们希望U尽可能是平方的——也就是说，当n1 + n2 + n3 - 2 = N时，必须满足n1 = n3 = max { k| k <= n2 for all 3 <= n2 <= N }
输入：
有多个测试用例。每个大小写包含一个字符串，每行不少于5个字符且不超过80个字符。该字符串不包含空白。
输出：
对于每个测试用例，按照描述中指定的U形打印输入字符串。
知识点： 暴力求解 模拟 图形排版
分析： N分成3份，余数都给横排。
AC代码：

#include <stdio.h>

int main() {