浙大PAT 1031. Hello World for U (20)

最新推荐文章于 2023-02-26 16:39:33 发布

iaccepted

最新推荐文章于 2023-02-26 16:39:33 发布

阅读量2.3k

点赞数

分类专栏： ACM-字符串文章标签： c c语言 pat string

本文链接：https://blog.csdn.net/IAccepted/article/details/20382773

版权

ACM-字符串专栏收录该内容

15 篇文章 0 订阅

订阅专栏

1031. Hello World for U (20)

时间限制

400 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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. 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，数据量最大在80，所以求n1与n2时直接暴力求解即可！

#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

int main(){
	int a,amax,b,k,len,i,j;
	char str[100];
	
	scanf("%s",str);
	len = strlen(str);
	amax = -1;
	for(b=3;b<=len;++b){
		for(a=1;a<=b;++a){
			if(2*a+b-2==len){
				if(a>amax)amax = a;
				continue;
			}
		}
	}

	a = amax;
	b = len+2-2*a;

	for(i=0;i<a-1;++i){
		cout<<str[i];
		for(j=0;j<b-2;++j){
			cout<<' ';
		}
		cout<<str[len-i-1]<<endl;
	}
	str[len-i]='\0';
	cout<<str+i<<endl;
	return 0;
}