码迷,mamicode.com
首页 > 其他好文 > 详细

1031. Hello World for U (20)

时间:2015-12-06 11:33:14      阅读:137      评论:0      收藏:0      [点我收藏+]

标签:

时间限制
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 n1characters, 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
 

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





1031. Hello World for U (20)

标签:

原文地址:http://www.cnblogs.com/zzandliz/p/5023115.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!