1031 Hello World for U （20 分)

最新推荐文章于 2020-05-22 07:30:55 发布

薛定谔的菜

最新推荐文章于 2020-05-22 07:30:55 发布

阅读量259

点赞数

分类专栏：图形输出

本文链接：https://blog.csdn.net/weixin_42105789/article/details/89476257

版权

图形输出专栏收录该内容

1 篇文章 0 订阅

订阅专栏

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, helloworldcan 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.

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

题意：就是把字符串按u型输出。

分析:1.k为竖列的个数,botttom为底部的个数。按题意k=(len+2)/3,bottom=len+2-2*k。（第一次写成k=len/3,bottom=len-2*k有两个测试点没过，是边界的问题吗，有大佬可以解释一下吗）。

2.第二点要注意的是输出的空格数是bottom-2。

#include <iostream>
#include <cstring>
using namespace std;

int main()
{
	string u;
	cin>>u;
	
	int len=u.length();
	int k=(len+2)/3;
	int bottom=len+2-2*k;
	
	for(int i=0;i<k-1;i++){
		cout<<u[i];
		for(int j=0;j<bottom-2;j++){
			printf(" ");
		}
		cout<<u[len-1-i]<<endl;
	}
	for(int i=0;i<bottom;i++){
		cout<<u[k+i-1];
	}
	return 0;
}