# 【PAT甲级】Hello World for U

### Problem Description：

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 `U` to be as squared as possible -- that is, it must be satisfied that n​1​​=n​3​​=max { k | k≤n​2​​ for all 3≤n​2​​≤N } 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!`

```h   !
e   d
l   l
lowor```

### AC代码：

```#include <bits/stdc++.h>
using namespace std;

int main()
{
string str;
getline(cin,str);
int n = str.length() + 2;
int n1 = n/3;    //n1是左右两条竖线从上到下的字符个数
int n2 = n1 + n%3;  //n2是底部横线从左到右的字符个数
char arr[30][30];
memset(arr,' ',sizeof(arr));
int cnt = 0;  //用来记录当前字符的下标
for(int i = 0; i < n1; i++)  //先排列左边那条竖线的n1个字符 hell
{
arr[i][0] = str[cnt++];
}
for(int i = 1; i < n2-1; i++)  //再排列底部那条横线(除去最左最右字符外)的那n2-2个字符  owo
{
arr[n1-1][i] = str[cnt++];
}
for(int i = n1-1; i >= 0; i--)  //最后排列右边那条竖线的n1个字符  rld!
{
arr[i][n2-1] = str[cnt++];
}
//打印U型图案
for(int i = 0; i < n1; i++)
{
for (int j = 0; j < n2; j++)
{
cout << arr[i][j];
}
cout << endl;
}
return 0;
}```

385 篇文章33 人订阅

0 条评论