PAT_A 1031. Hello World for U (20)

本文主要是介绍PAT_A 1031. Hello World for U (20)，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

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

• 分析：没什么说的吧，就是按照上边的公式找出最大的n１输出U型串即可。
• code:

#include<iostream>
#include<cstring>
using namespace std;
int main()
{char s[90];cin>>s;int size=strlen(s);int n1,n2,n3,tmp;n1=0;for(int i=3;i<size;i++){tmp=(size+2-i)/2;if(tmp<=i){if(tmp>n1){n1=tmp;n2=size+2-n1*2;}}}for(int i=0;i<n1;i++){cout<<s[i];for(int j=1;j<n2-1;j++){if(i==n1-1)cout<<s[i+j];elsecout<<" ";}cout<<s[size-1-i];cout<<endl;}return 0;
}

• 
  

这篇关于PAT_A 1031. Hello World for U (20)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---