PAT1031 Hello World for U （20 分）

最新推荐文章于 2021-02-20 15:02:03 发布

peanwang

最新推荐文章于 2021-02-20 15:02:03 发布

阅读量199

点赞数 1

分类专栏： PAT-A

本文链接：https://blog.csdn.net/weixin_41256413/article/details/83242077

版权

PAT-A 专栏收录该内容

81 篇文章 1 订阅

订阅专栏

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 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
$n 1 = n 3 = m a x$ { $k ∣ k \leq n 2$ for all $3 \leq n 2 \leq 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!

Sample Output:

h   !
e   d
l   l
lowor

解析

这题本以为可以发现字符排列的规律的。但是没有。
这个条件我找不到n1,n2,n3的等式。
$n 1 = n 3 = m a x$ { $k ∣ k \leq n 2$ for all $3 \leq n 2 \leq N$ } with $n 1 + n 2 + n 3 - 2 = N$ .
没办法：只能使用暴力迭代了
因为n1 = n2，所以可以得到n1和n2的表达式为 $2 * n 1 + n 2 - 2 = N$ 。根据n2的值.
因为n2在 $3 \leq n 2 \leq N$ 。所以迭代n2的值。根据上面推的式子，可以的到n1的值。其中：每步迭代中，n1最大的值且n1<=n2。那么这就是n1,n2,n3的值，具体代码如下：

	char input[100];
	scanf("%s", input);
	int Len = strlen(input);
	int n1, n2;
	for (n2 = 3; n2 <= Len; n2++) {
		n1 = (Len + 2 - n2)/2;
		if (n1 + n1 + n2 - 2 == Len && n1 <= n2)
			break;
	}

知道n1,n2,n3的值后，我把字符串填充到二维数组里。最后输出二维数组。

#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main()
{
	char input[100];
	scanf("%s", input);
	int Len = strlen(input);
	int n1, n2;
	for (n2 = 3; n2 <= Len; n2++) {
		n1 = (Len + 2 - n2)/2;
		if (n1 + n1 + n2 - 2 == Len && n1 <= n2)
			break;
	}
	vector<vector<char>> array(n1,vector<char>(n2,' '));
	int index = 0;     // for string
	for (int i = 0; i < n1; i++) 
		array[i][0] = input[index++];
	for (int i = 1; i < n2 - 1; i++)
		array[n1 - 1][i] = input[index++];
	for (int i = n1 - 1; i >= 0; i--)
		array[i][n2 - 1] = input[index++];
	for (auto v : array) {
		for (auto i : v)
			printf("%c", i);
		printf("\n");
	}
	return 0;
}