PAT日志 1031

最新推荐文章于 2021-07-09 09:53:40 发布

原创最新推荐文章于 2021-07-09 09:53:40 发布 · 157 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT #1031

PAT日志专栏收录该内容

44 篇文章

订阅专栏

顽强的小白

1031 Hello World for U （20 分）

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型散了，不会改，脑补吧。
题目内容就是他给你一个单词（字符串）你要把它输出为U型，为了让这个型最好看，需要平衡三个边的长度，题目那个算两边长度的公式好长，但是仔细看就会发现其实只要三个边长度尽可能三等分就是最好的，如果不能三等分，就把多余的字母放在底部，还有注意题目中两个边的长度是和底边重叠了一个的。
剩下的就是输出问题了，慢慢来就行了。

代码实现

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