【PAT】【Advanced Level】1031. Hello World for U (20)

最新推荐文章于 2021-05-03 16:13:25 发布

原创最新推荐文章于 2021-05-03 16:13:25 发布 · 334 阅读

0 ·

CC 4.0 BY-SA版权

PAT 专栏收录该内容

132 篇文章

订阅专栏

本文提供了一道 PAT A 类竞赛题“HelloWorldforU”的详细解答过程，该题要求将输入字符串以特定的 U 形状输出，并确保 U 的形状尽可能地接近正方形。

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

1031. Hello World for U (20)

时间限制

400 ms

内存限制

65536 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

原题链接：

https://www.patest.cn/contests/pat-a-practise/1031

思路：

按要求求出N1N2N3的值即可，加2除三得到N1N3，总数减去N1N3得到N2。

CODE：

#include<iostream>
#include<cstring>
#include<string>

using namespace std;

int main()
{
    string a;
    cin>>a;
    int n=a.length();
    int n1=(n+2)/3-1;
    int n3=n1;
    int n2=n-n1-n3;
    //cout<<n1<<" "<<n2<<" "<<n3<<endl;
    for (int i=0;i<n1;i++)
    {
        cout<<a[i];
        for (int j=2;j<n2;j++) cout<<" ";
        cout<<a[a.length()-1-i];
        cout<<endl;
    }
    for (int i=0;i<n2;i++)
        cout<<a[n1+i];
    return 0;
}