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<iostream>#include<vector>#include<stdio.h>#include<algorithm>#include<math.h>#include<map>using namespace std;int main(){    string str;    cin>>str;    int leftAndRight,bottom,len=(int)str.size();    double res=(len+2)/3.0;    leftAndRight = (int)res;    bottom = len+2-2*leftAndRight;    for(int i=0;i<leftAndRight-1;i++){        printf("%c",str[i]);        for(int j=1;j<=bottom-2;j++)            printf(" ");        printf("%c\n",str[len-1-i]);    }    for(int i=0;i<bottom;i++){        printf("%c",str[leftAndRight-1+i]);        if(i==bottom-1)            printf("\n");    }    return 0;}