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

注意：

1、简单的对字符串的操作，只要把n1、n2、n3的关系理解了就可以了。

2、n1=n3=(N+2)/3;n2=N-2*n1;

3、注意上面的(N+2)/3是整数相除。

代码：

#include<iostream>#include<cstring>using namespace std;int main(){char str[85];cin>>str;int len=strlen(str);int i;for(i=0;i<(len+2)/3-1;++i){cout<<str[i];for(int j=0;j<len-(len+2)/3*2;++j)cout<< ' ';cout<<str[len-i-1]<<endl;}for(int j=i;j<=len-i-1;++j)cout<<str[j];cout<<endl;return 0;}