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   l

分析：

（1）本题的问题就是划分 n1,n2,n3，需要记住的是 int （5/2） 是等于2，不满足四舍五入的；

（2）按照要求利用循环输出即可。

#include <iostream>#include <string>using namespace std;int main (){string s;cin>>s;int n1,n2,n3;n1=(s.length()+2)/3;n3=n1;n2=s.length()+2-n1-n3;//cout<<n1<<n2<<n3<<endl;    int i,j,t;for (i=0;i<n1-1;i++){cout<<s[i];for (j=0;j<n2-2;j++){cout<<" ";}        cout<<s[s.length()-1-i]<<endl;}for (t=0;t<n2;t++){cout<<s[n1+t-1];}cout<<int(5/2);return 0;}