1031. Hello World for U

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  de  ll  rlowo

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   dl   llowor

#include<stdio.h>#include<string.h> using namespace std;char output[30][30];char str[82];int main(){gets(str);int size = strlen(str);int h = (size+2) / 3;int w = size - 2*h;int point = 0;for(int i = 0; i < h; i ++)for(int j = 0; j < w+2; j ++)output[i][j] = ' ';for(int i = 0; i < h; i ++, point ++)output[i][0] = str[point];for(int i = 1; i <= w; i ++, point ++)output[h-1][i] = str[point];for(int i = h-1; i >= 0; i --, point ++)output[i][w+1] = str[point];for(int i = 0; i < h; i ++){for(int j = 0; j < w+2; j ++)printf("%c", output[i][j]);printf("\n");}return 0;}