PAT-A1031 Hello World for U

最新推荐文章于 2024-09-12 09:20:36 发布

terter努力学习中|･ω･｀)

最新推荐文章于 2024-09-12 09:20:36 发布

阅读量100

点赞数

分类专栏： PAT甲级刷题

本文链接：https://blog.csdn.net/weixin_46055626/article/details/120256394

版权

字符串处理算法实现 U形排列代码示例字符分布

关键词由CSDN通过智能技术生成

PAT甲级刷题专栏收录该内容

36 篇文章 0 订阅

订阅专栏

A1031 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=ma**x { 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结尾无空行

题意：

输入N个字符，将他们排成’U’型，要求如下：

在这里插入图片描述

分析：

本题主要就是n1,n2和n3之间关系的计算

n1=(len+2)/3;
n2=len-2*n1+2;

注意输出时不要昏头 (=´ω｀=)

代码如下：

#include<cstdio>
#include<string.h>
int main(){
char S[101];
scanf("%s",&S);
int len=strlen(S);
int n1,n2;
n1=(len+2)/3;
n2=len-2*n1+2;
for(int i=0;i<n1-1;i++){
	printf("%c",S[i]);
	for(int j=0;j<n2-2;j++){
		printf(" ");
	}
	printf("%c\n",S[len-i-1]);
}	
for(int i=0;i<n2;i++){
	printf("%c",S[n1+i-1]);
}
	return 0;
}