1031. Hello World for U (20)

最新推荐文章于 2023-05-04 23:30:57 发布

SDUTyangkun

最新推荐文章于 2023-05-04 23:30:57 发布

阅读量235

点赞数

分类专栏： pat甲级练习

本文链接：https://blog.csdn.net/SDUTyangkun/article/details/77917654

版权

pat甲级练习专栏收录该内容

30 篇文章 0 订阅

订阅专栏

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

#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
    char s[100];
    scanf("%s", s);
    int len = strlen(s);
    int n = (len + 2) / 3;
    int m = len - 2*n;
    int l = 0, r = len - 1;
   for(int i = 0; i < n - 1; i++)
   {
       printf("%c",s[l]);
       for(int j = 0; j < m; j++)
        printf(" ");
       printf("%c\n",s[r]);
       l++;
       r--;
   }
      for(int i = 0; i < m+2; i++)
    printf("%c", s[l++]);

}