[ PAT-A ] 1031 Hello World for U (C++)

最新推荐文章于 2022-11-29 08:50:46 发布

顾_wolf

最新推荐文章于 2022-11-29 08:50:46 发布

阅读量218

点赞数

分类专栏： [算法编程]PAT-A 文章标签： PAT algorithm

本文链接：https://blog.csdn.net/S_zhicheng27/article/details/81627815

版权

[算法编程]PAT-A 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

题目描述

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!

Sample Output:
h       !
e      d
l        l
lowor

解题思路

题目大意
给定一串字符,将其按U字形输出
思路
输出格式问题.假设字符长度为n,则
输出U字形的高度为(n+2)/3,宽度为(n+2)/3+(n+2)%3;

代码设计

//AC代码
//zhicheng
#include<cstdio>
#include<cstring>
//zhicheng
//August 13,2018
const int maxn=85;
char a[maxn];
int main()
{
    scanf("%s",a);
    int len=strlen(a);
    int h=(len+2)/3,w=(len+2)/3+(len+2)%3,i=0,j=len-1;
    for(int k=1;k<h;k++)
    {
        printf("%c",a[i++]);
        for(int v=1;v<=w-2;v++) printf(" ");
        printf("%c",a[j--]);
        printf("\n");
    }
    for(;i<=j;)printf("%c",a[i++]);
    printf("\n");
    return 0;
}