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

来源： <http://www.patest.cn/contests/pat-a-practise/1031>

 

1. #pragma warning(disable:4996)
2. #include <stdio.h>
3. #include <string>
4. #include <iostream>
6. using namespace std;
8. int main(void) {
9. int n1, n2, n3;
10. string s;
11. cin >> s;
12. n1 = n3 = (s.length() - 1) / 3;
13. n1++; n3++;
14. n2 = s.length() + 2 - 2 * n1;
16. for (int i = 0; i < n1 - 1; i++) {
17. cout << s[i];
18. for (int i = 0; i < n2 - 2; i++)
19. cout << ' ';
20. cout << s[s.length() - i - 1] << endl;
21. }
22. for (int i = n1 - 1; i < n1 + n2-1; i++) {
23. cout << s[i];
24. }
26. return 0;
28. }

来自为知笔记(Wiz)

转载于:https://www.cnblogs.com/zzandliz/p/5023115.html