【PAT】A1031 Hello World for U【图形输出】

最新推荐文章于 2020-06-08 09:33:19 发布

昵称五个字

最新推荐文章于 2020-06-08 09:33:19 发布

阅读量655

点赞数 1

CC 4.0 BY-SA版权

分类专栏： PAT

本文链接：https://blog.csdn.net/a617976080/article/details/95385379

PAT 专栏收录该内容

163 篇文章

订阅专栏

博客围绕将给定字符串按U型输出展开。介绍了输入输出规范、示例，阐述题意为按特定公式将字符串以U型输出，给出思路是计算N1、N3和N2，考虑下标和循环次数按行输出，最后给出了实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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=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型输出，要求满足公式n1=n3=max { k | k≤n2 for all 3≤n2≤N }和n1+n2+n3−2=N

思路

按题意N1 = [(N + 2) / 3](向下取整是因为N1要小于等于N2)。然后就可以算出N3和N2，仔细考虑下标和循环次数，按行输出即可。

代码

#include <iostream>
#include <cstdio>
#include <cstring>
int main() {
    char str[100];
    scanf("%s", str);
    
    // 通过公式计算出n1、n2
    int
    N = (int)strlen(str),
    n1 = (N + 2) / 3,
    n2 = N + 2 - n1 - n1;
    
    // 输出第一行到倒数第二行
    for(int i = 0; i < n1 - 1; i++){
        putchar(str[i]);
        
        // 输出中间的空格
        for(int j = n2 - 3; j >= 0; j--){
            putchar(' ');
        }
        
        
        putchar(str[N - i - 1]);
        
        // 记得输出换行符
        putchar('\n');
    }
    
    // 输出最后一行
    for(int i = n1 - 1, l = n1 + n2 - 1; i < l; i++){
        putchar(str[i]);
    }
    return 0;
}